( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Preface.

, и . Theor. Comput. Sci., (2014)

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.

Heiko Vogler

Heiko Vogler

Heiko Vogler

Heiko Vogler

Heiko Vogler

 

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

Determinization of Finite State Weighted Tree Automata., и . Journal of Automata, Languages and Combinatorics, 8 (3): 417-463 (2003)Basic Tree Transducers.. CAAP, том 214 из Lecture Notes in Computer Science, стр. 183-195. Springer, (1986)A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem., , и . LATA, том 9618 из Lecture Notes in Computer Science, стр. 127-139. Springer, (2016)Relationally defined clones of tree functions closed under selection or primitive recursion., , и . Acta Cybern., 16 (3): 411-425 (2004)A Pumping Lemma for Output Languages of Attributed Tree Transducers., и . Acta Cybern., 11 (4): 261-305 (1994)Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable., , , и . DCFS, том 12442 из Lecture Notes in Computer Science, стр. 39-51. Springer, (2020)Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata., , и . CIAA, том 13266 из Lecture Notes in Computer Science, стр. 93-105. Springer, (2022)Efficient Call-by-value Evaluation Strategy of Primitive Recursive Program Schemes, и . Proceedings of the Fuji International Workshop in Functional and Logic Programming, World Scientific Publishing Co. Pte Ltd., (1995)Iterated linear control and iterated one-turn pushdowns.. FCT, том 199 из Lecture Notes in Computer Science, стр. 474-483. Springer, (1985)A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage., и . CoRR, (2019)