Author of the publication

Length-reducing Automata (almost) without Auxiliary Symbols.

, and . Journal of Automata, Languages and Combinatorics, 16 (2-4): 141-164 (2011)

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

Approximation of grammar-based compression via recompression.. Theor. Comput. Sci., (2015)Equations over sets of integers with addition only., and . J. Comput. Syst. Sci., 82 (6): 1007-1019 (2016)Parikh's Theorem Made Symbolic., , and . Proc. ACM Program. Lang., 8 (POPL): 1945-1977 (January 2024)Computational completeness of equations over sets of natural numbers., and . Inf. Comput., (2014)Unambiguous Conjunctive Grammars over a One-Letter Alphabet., and . Developments in Language Theory, volume 7907 of Lecture Notes in Computer Science, page 277-288. Springer, (2013)On the Computational Completeness of Equations over Sets of Natural Numbers., and . ICALP (2), volume 5126 of Lecture Notes in Computer Science, page 63-74. Springer, (2008)Space-efficient conversions from SLPs., , and . CoRR, (2022)Parikh's Theorem Made Symbolic., , and . CoRR, (2023)Recompression: Technique for Word Equations and Compressed Data.. LATA, volume 12038 of Lecture Notes in Computer Science, page 44-67. Springer, (2020)The smallest grammar problem revisited., , , , , , and . CoRR, (2019)