Author of the publication

Deleting Deterministic Restarting Automata with Two Windows.

, and . DLT, volume 10396 of Lecture Notes in Computer Science, page 272-283. Springer, (2017)

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

Church-Rosser Thue systems and formal languages., , and . J. ACM, 35 (2): 324-344 (1988)On Dehn Functions of Finitely Presented Bi-Automatic Monoids.. Journal of Automata, Languages and Combinatorics, 5 (4): 405-419 (2000)Decidable Sentences for Context-Free Groups., and . STACS, volume 480 of Lecture Notes in Computer Science, page 160-171. Springer, (1991)On Restarting Automata with Window Size One.. DCFS, volume 6808 of Lecture Notes in Computer Science, page 8-33. Springer, (2011)An Automata-Theoretical Characterization of Context-Free Trace Languages., and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 406-417. Springer, (2011)Cross-Sections for Finitely Presented Monoids with Decidable Word Problems., , and . RTA, volume 1232 of Lecture Notes in Computer Science, page 53-67. Springer, (1997)On McNaughton Families of Languages That Are Specified by Some Variants of Monadic String-Rewriting Systems., and . Fundam. Informaticae, 112 (2-3): 219-238 (2011)A Complete Taxonomy of Restarting Automata without Auxiliary Symbols.. Fundam. Informaticae, 180 (1-2): 77-101 (2021)Two-Sided Strictly Locally Testable Languages., , and . Fundam. Informaticae, 180 (1-2): 29-51 (2021)Restarting Transducers, Regular Languages, and Rational Relations., and . Theory Comput. Syst., 57 (1): 195-225 (2015)