Author of the publication

On the expressive power of univariate equations over sets of natural numbers.

, and . IFIP TCS, volume 273 of IFIP, page 215-227. Springer, (2008)

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

One-Visit Caterpillar Tree Automata., , and . Fundam. Informaticae, 52 (4): 361-375 (2002)State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata., and . Fundam. Informaticae, 110 (1-4): 231-239 (2011)On language equations with concatenation and various sets of Boolean operations.. RAIRO Theor. Informatics Appl., 49 (3): 205-232 (2015)Least and Greatest Solutions of Equations over Sets of Integers., and . MFCS, volume 6281 of Lecture Notes in Computer Science, page 441-452. Springer, (2010)On the Expressive Power of GF(2)-Grammars., and . SOFSEM, volume 11376 of Lecture Notes in Computer Science, page 310-323. Springer, (2019)Input-driven pushdown automata: nondeterminism and unambiguity., and . NCMA, volume 294 of books@ocg.at, page 31-33. Österreichische Computer Gesellschaft, (2013)State complexity of cyclic shift., and . DCFS, page 182-193. Università degli Studi di Milano, Milan, Italy, (2005)On the Number of Nonterminals in Linear Conjunctive Grammars.. DCFS, page 274-283. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)State Complexity of Operations on Input-Driven Pushdown Automata., and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 485-496. Springer, (2011)Boolean Grammars.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 398-410. Springer, (2003)