( en | de | ru )

 

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

Author of the publication

copydeleteadd this publication to your clipboard
Analysis of Scatternet Formation in High-Rate Multi-Hop WPANS.

, , , , and . PIMRC, page 1-6. IEEE, (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.

Balázs Fülöp

Gábor Fülöp

Fülöp Scheibler

Andreas Fülöp

Annabelle Fülöp

 

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)On ranges of compositions of deterministic root-to-frontier tree transformations., and . Acta Cybern., 8 (3): 259-266 (1988)Bottom-Up and Top-Down Tree Series Transformations., , and . Journal of Automata, Languages and Combinatorics, 7 (1): 11-70 (2002)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)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)Decidability Boundaries for the Finite-Image Property of Weighted Finite Automata., , and . Int. J. Found. Comput. Sci., 34 (6): 633-653 (September 2023)Weighted Tree Automata - May it be a little more?, and . CoRR, (2022)Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable., , , and . DCFS, volume 12442 of Lecture Notes in Computer Science, page 39-51. Springer, (2020)