Author of the publication

A Polynomial-Time Algorithm for Checking the Equivalence for Real-Time Deterministic Restricted One-Counter Transducers Which Accept by Final State.

, , and . SNPD, page 459-465. IEEE Computer Society, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Worst-Case Time Complexity for Generating All Maximal Cliques., , and . COCOON, volume 3106 of Lecture Notes in Computer Science, page 161-170. Springer, (2004)A Polynomial-Time Algorithm for Checking the Inclusion for Real-Time Deterministic Restricted One-Counter Automata Which Accept by Accept Mode, , and . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1998)Protein Threading with Profiles and Distance Constraints Using Clique Based Algorithms., , , , and . J. Bioinform. Comput. Biol., 4 (1): 19-42 (2006)Speeding-Up of Construction Algorithms for the Graph Coloring Problem., , , and . BWCCA, volume 159 of Lecture Notes in Networks and Systems, page 211-222. Springer, (2020)Guest Editors' Foreword., and . J. Graph Algorithms Appl., 20 (1): 1-2 (2016)A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique., , , , , and . FAW, volume 9711 of Lecture Notes in Computer Science, page 215-226. Springer, (2016)A Polynomial-Time Algorithm for Checking the Inclusion for Strict Deterministic Restricted One-Counter Automata, , and . TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems, (1995)Enumerating Maximal Isolated Cliques Based on Vertex-Dependent Connection Lower Bound., , and . MLDM, volume 9729 of Lecture Notes in Computer Science, page 569-583. Springer, (2016)Learning Boolean Functions in AC0 on Attribute and Classification Noise., , and . ALT, volume 3244 of Lecture Notes in Computer Science, page 142-155. Springer, (2004)Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data., , and . ICGI, volume 3264 of Lecture Notes in Computer Science, page 260-272. Springer, (2004)