Author of the publication

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)

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

Restarting Transducers, Regular Languages, and Rational Relations., and . Theory Comput. Syst., 57 (1): 195-225 (2015)String-Rewriting Systems., and . Texts and Monographs in Computer Science Springer, (1993)On a class of rational functions for pictures., , and . NCMA, volume 318 of books@ocg.at, page 159-176. Österreichische Computer Gesellschaft, (2015)On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems., and . NCMA, volume 263 of books@ocg.at, page 113-126. Austrian Computer Society, (2010)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 Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata., , and . LATA, volume 5457 of Lecture Notes in Computer Science, page 660-671. Springer, (2009)On the Complexity of 2-Monotone Restarting Automata., , , and . Theory Comput. Syst., 42 (4): 488-518 (2008)On h-Lexicalized Restarting List Automata., , and . J. Autom. Lang. Comb., 25 (2-3): 201-234 (2020)Codes Modulo Finite Monadic String-Rewriting Systems., and . Theor. Comput. Sci., 134 (1): 175-188 (1994)An Automata-Theoretical Characterization of Context-Free Trace Languages., and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 406-417. Springer, (2011)