PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Fülöp, Zoltán"

Author of the publication

copydeleteadd this publication to your clipboard
Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen.

, and . Bulletin of the EATCS, (1989)

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.

Zoltan Lovasz University of Stuttgart

 

Other publications of authors with the same name

The Emptiness Problem is Undecidable for Domains of Partial Monadic 2-Modular Tree Transformations., and . Inf. Process. Lett., 36 (6): 293-296 (1990)Congruential tree languages are the same as recognizable tree languages - a proof for a theorem of D. Kozen., and . Bulletin of the EATCS, (1989)Undecidable Properties of Deterministic Top-Down Tree Transducers.. Theor. Comput. Sci., 134 (2): 311-328 (1994)A Complete Classification of Deterministic Root-To-Frontier Tree Transformation Classes., and . Theor. Comput. Sci., 81 (1): 1-15 (1991)On ranges of compositions of deterministic root-to-frontier tree transformations., and . Acta Cybern., 8 (3): 259-266 (1988)Equational Weighted Tree Transformations with Discounting., and . Algebraic Foundations in Computer Science, volume 7020 of Lecture Notes in Computer Science, page 112-145. Springer, (2011)Bottom-Up and Top-Down Tree Series Transformations., , and . Journal of Automata, Languages and Combinatorics, 7 (1): 11-70 (2002)Preservation of Recognizability for Synchronous Tree Substitution Grammars., , and . ATANLP@ACL 2010, page 1-9. Association for Computational Linguistics, (2010)Minimal Equational Representations of Recognizable Tree Languages., and . Acta Inf., 34 (1): 59-84 (1997)A Note on the Equivalence Problem of E-Patterns., and . Inf. Process. Lett., 57 (3): 125-128 (1996)