Author of the publication

Lambda-Confluence Is Undecidable for Clearing Restarting Automata.

, and . CIAA, volume 7982 of Lecture Notes in Computer Science, page 256-267. Springer, (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

Two-Sided Strictly Locally Testable Languages., , and . Fundam. Informaticae, 180 (1-2): 29-51 (2021)A Complete Taxonomy of Restarting Automata without Auxiliary Symbols.. Fundam. Informaticae, 180 (1-2): 77-101 (2021)Church-Rosser Thue systems and formal languages., , and . J. ACM, 35 (2): 324-344 (1988)Reversibility for stateless ordered RRWW-automata., and . Acta Informatica, 58 (4): 397-425 (2021)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)Weighted Restarting Automata and Pushdown Relations., , and . CAI, volume 9270 of Lecture Notes in Computer Science, page 196-207. Springer, (2015)A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet., , and . COCOON, volume 1276 of Lecture Notes in Computer Science, page 393-402. Springer, (1997)Learning Analysis by Reduction from Positive Data., , and . ICGI, volume 4201 of Lecture Notes in Computer Science, page 125-136. Springer, (2006)On the Gap-Complexity of Simple RL-Automata., , and . Developments in Language Theory, volume 4036 of Lecture Notes in Computer Science, page 83-94. Springer, (2006)