From post

A Complete Characterization of Repetitive Morphisms over the Two-Letter Alphabet.

, , и . COCOON, том 1276 из Lecture Notes in Computer Science, стр. 393-402. Springer, (1997)

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.

 

Другие публикации лиц с тем же именем

On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata., , и . LATA, том 5457 из Lecture Notes in Computer Science, стр. 660-671. Springer, (2009)Restarting Transducers, Regular Languages, and Rational Relations., и . Theory Comput. Syst., 57 (1): 195-225 (2015)On a class of rational functions for pictures., , и . NCMA, том 318 из books@ocg.at, стр. 159-176. Österreichische Computer Gesellschaft, (2015)On McNaughton Families of Languages Specified by Certain Variants of Monadic String-Rewriting Systems., и . NCMA, том 263 из books@ocg.at, стр. 113-126. Austrian Computer Society, (2010)String-Rewriting Systems., и . Texts and Monographs in Computer Science Springer, (1993)An Automata-Theoretical Characterization of Context-Free Trace Languages., и . SOFSEM, том 6543 из Lecture Notes in Computer Science, стр. 406-417. Springer, (2011)Cross-Sections for Finitely Presented Monoids with Decidable Word Problems., , и . RTA, том 1232 из Lecture Notes in Computer Science, стр. 53-67. Springer, (1997)A Characterization of the Context-Free Languages by Stateless Ordered Restart-Delete Automata.. SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 39-50. Springer, (2020)On Lexicalized Well-Behaved Restarting Automata That Are Monotone., , и . Developments in Language Theory, том 6224 из Lecture Notes in Computer Science, стр. 352-363. Springer, (2010)On Restarting Automata with Window Size One.. DCFS, том 6808 из Lecture Notes in Computer Science, стр. 8-33. Springer, (2011)