Regular Characterizations of Macro Tree Transducers. - Joost Engelfriet; Heiko Vogler (CAAP, 1984)

Characterization of High Level Tree Transducers. - Joost Engelfriet; Heiko Vogler (ICALP, 1985)

Macro Tree Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1985)

Iterated Linear Control and Iterated One-Turn Pushdowns. - Heiko Vogler (Math. Syst. Theory, 1986)

Pushdown Machines for the Macro Tree Transducer. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1986)

Corrigenda: Pushdown Machines for the Macro Tree Tranducer. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1986)

Basic Tree Transducers. - Heiko Vogler (J. Comput. Syst. Sci., 1987)

Look-Ahead on Pushdowns - Joost Engelfriet; Heiko Vogler (Inf. Comput., 1987)

High Level Tree Transducers and Iterated Pushdown Tree Transducers. - Joost Engelfriet; Heiko Vogler (Acta Informatica, 1988)

The OI-Hierarchy Is Closed under Control - Heiko Vogler (Inf. Comput., 1988)

Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers. - Heiko Vogler (Sci. Comput. Program., 1991)

Modular Tree Transducers. - Joost Engelfriet; Heiko Vogler (Theor. Comput. Sci., 1991)

An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines. - Heinz Faßbender; Heiko Vogler (Formal Aspects Comput., 1992)

Tree Transducers with External Functions. - Zoltán Fülöp 001; Frank Herrmann; Sándor Vágvölgyi; Heiko Vogler (Theor. Comput. Sci., 1993)

Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic. - Armin Kühnemann; Heiko Vogler (Acta Informatica, 1994)

A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing. - Heinz Faßbender; Heiko Vogler (Acta Cybern., 1994)

A Pumping Lemma for Output Languages of Attributed Tree Transducers. - Armin Kühnemann; Heiko Vogler (Acta Cybern., 1994)

Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars. - Thomas Noll 001; Heiko Vogler (Fundam. Informaticae, 1994)

The Translation Power of Top-Down Tree-to-Graph Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1994)

Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers. - Heinz Faßbender; Andrea Mößle; Heiko Vogler (J. Funct. Log. Program., 1996)

Benefits of Hypergraphs for Program Transformation. - Andrea Mößle; Heiko Vogler (GI Jahrestagung, 1997)

Attributed Context-Free Hypergraph Grammars. - Sebastian Maneth; Heiko Vogler (J. Autom. Lang. Comb., 1998)

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. - Joost Engelfriet; Heiko Vogler (J. Comput. Syst. Sci., 1998)

Syntax-Directed Semantics - Formal Models Based on Tree Transducers - Zoltán Fülöp 001; Heiko Vogler (Springer, 1998)

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. - Zoltán Fülöp 001; Heiko Vogler (Theory Comput. Syst., 1999)

The Universality of Higher-Order Attributed Tree Transducers. - Thomas Noll 001; Heiko Vogler (Theory Comput. Syst., 2001)

Bottom-Up and Top-Down Tree Series Transformations. - Joost Engelfriet; Zoltán Fülöp 001; Heiko Vogler (J. Autom. Lang. Comb., 2002)

Determinization of Finite State Weighted Tree Automata. - Björn Borchardt; Heiko Vogler (J. Autom. Lang. Comb., 2003)

Editorial. - Manfred Droste; Heiko Vogler (J. Autom. Lang. Comb., 2003)

Tree Series Transformations that Respect Copying. - Zoltán Fülöp 001; Heiko Vogler (Theory Comput. Syst., 2003)

Relationally defined clones of tree functions closed under selection or primitive recursion. - Reinhard Pöschel; Alexander Semigrodskikh; Heiko Vogler (Acta Cybern., 2004)

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. - Zoltán Fülöp 001; Armin Kühnemann; Heiko Vogler (Inf. Process. Lett., 2004)

Weighted Tree Transducers. - Zoltán Fülöp 001; Heiko Vogler (J. Autom. Lang. Comb., 2004)

Syntactic composition of top-down tree transducers is short cut fusion. - Claus Jürgensen; Heiko Vogler (Math. Struct. Comput. Sci., 2004)

Hierarchies of tree series transformations. - Zoltán Fülöp 001; Zsolt Gazdag; Heiko Vogler (Theor. Comput. Sci., 2004)

Incomparability Results for Classes of Polynomial Tree Series Transformations. - Andreas Maletti; Heiko Vogler (J. Autom. Lang. Comb., 2005)

A Kleene Theorem for Weighted Tree Automata. - Manfred Droste; Christian Pech; Heiko Vogler (Theory Comput. Syst., 2005)

Linear deterministic multi bottom-up tree transducers. - Zoltán Fülöp 001; Armin Kühnemann; Heiko Vogler (Theor. Comput. Sci., 2005)

Cut sets as recognizable tree languages. - Björn Borchardt; Andreas Maletti; Branimir Seselja; Andreja Tepavcevic; Heiko Vogler (Fuzzy Sets Syst., 2006)

Weighted tree automata and weighted logics. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2006)

Learning Deterministically Recognizable Tree Series. - Frank Drewes; Heiko Vogler (J. Autom. Lang. Comb., 2007)

A note on cut-worthiness of recognizable tree series. - Branimir Seselja; Andreja Tepavcevic; Heiko Vogler (Fuzzy Sets Syst., 2008)

Weighted automata with discounting. - Manfred Droste; Jacques Sakarovitch; Heiko Vogler (Inf. Process. Lett., 2008)

Weighted monadic datalog. - Torsten Stüber; Heiko Vogler (Theor. Comput. Sci., 2008)

Compositions of Top-Down Tree Transducers with epsilon-Rules. - Andreas Maletti; Heiko Vogler (FSMNLP, 2009)

Bisimulation Minimisation of Weighted Automata on Unranked Trees. - Johanna Högberg; Andreas Maletti; Heiko Vogler (Fundam. Informaticae, 2009)

Decomposition of Weighted multioperator Tree Automata. - Torsten Stüber; Heiko Vogler; Zoltán Fülöp 001 (Int. J. Found. Comput. Sci., 2009)

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Theory Comput. Syst., 2009)

n-Best Parsing Revisited. - Matthias Büchse; Daniel Geisler; Torsten Stüber; Heiko Vogler (ATANLP@ACL 2010, 2010)

A Decoder for Probabilistic Synchronous Tree Insertion Grammars. - Steve DeNeefe; Kevin Knight; Heiko Vogler (ATANLP@ACL 2010, 2010)

Preservation of Recognizability for Synchronous Tree Substitution Grammars. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (ATANLP@ACL 2010, 2010)

Efficient Inference through Cascades of Weighted Tree Transducers. - Jonathan May; Kevin Knight; Heiko Vogler (ACL, 2010)

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. - Manfred Droste; Heiko Vogler (Developments in Language Theory, 2010)

Determinization of weighted finite automata over strong bimonoids. - Miroslav Ciric 001; Manfred Droste; Jelena Ignjatovic; Heiko Vogler (Inf. Sci., 2010)

Weighted finite automata over strong bimonoids. - Manfred Droste; Torsten Stüber; Heiko Vogler (Inf. Sci., 2010)

Determinization of Weighted Tree Automata Using Factorizations. - Matthias Büchse; Jonathan May; Heiko Vogler (J. Autom. Lang. Comb., 2010)

Tree Parsing with Synchronous Tree-Adjoining Grammars. - Matthias Büchse; Mark-Jan Nederhof; Heiko Vogler (IWPT, 2011)

Weighted Extended Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Fundam. Informaticae, 2011)

Weighted Logics for Unranked Tree Automata. - Manfred Droste; Heiko Vogler (Theory Comput. Syst., 2011)

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. - Matthias Büchse; Andreas Maletti; Heiko Vogler (Developments in Language Theory, 2012)

Synchronous Context-Free Tree Grammars. - Mark-Jan Nederhof; Heiko Vogler (TAG, 2012)

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. - Zoltán Fülöp 001; Torsten Stüber; Heiko Vogler (Theory Comput. Syst., 2012)

Weighted automata and multi-valued logics over arbitrary bounded lattices. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2012)

General binarization for parsing and translation. - Matthias Büchse; Alexander Koller; Heiko Vogler (ACL (1), 2013)

Hybrid Grammars for Discontinuous Parsing. - Mark-Jan Nederhof; Heiko Vogler (COLING, 2014)

Forward and backward application of symbolic tree transducers. - Zoltán Fülöp 001; Heiko Vogler (Acta Informatica, 2014)

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages. - Manfred Droste; Heiko Vogler (Int. J. Found. Comput. Sci., 2014)

Tree parsing for tree-adjoining machine translation. - Matthias Büchse; Heiko Vogler; Mark-Jan Nederhof (J. Log. Comput., 2014)

Preface. - Manfred Droste; Heiko Vogler (Theor. Comput. Sci., 2014)

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. - Manfred Droste; Doreen Heusel; Heiko Vogler (CAI, 2015)

A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. - Luisa Herrmann 001; Heiko Vogler (CAI, 2015)

Characterizing weighted MSO for trees by branching transitive closure logics. - Zoltán Fülöp 001; Heiko Vogler (Theor. Comput. Sci., 2015)

Weighted Symbolic Automata with Data Storage. - Luisa Herrmann 001; Heiko Vogler (DLT, 2016)

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. - Heiko Vogler; Manfred Droste; Luisa Herrmann 001 (LATA, 2016)

Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. - Mark-Jan Nederhof; Markus Teichmann; Heiko Vogler (J. Autom. Lang. Comb., 2016)

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. - Kilian Gebhardt; Mark-Jan Nederhof; Heiko Vogler (Comput. Linguistics, 2017)

Weighted Regular Tree Grammars with Storage. - Zoltán Fülöp 001; Luisa Herrmann 001; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2018)

Characterizations of recognizable weighted tree languages by logic and bimorphisms. - Zoltán Fülöp 001; Heiko Vogler (Soft Comput., 2018)

Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. - Zoltán Fülöp 001; Heiko Vogler (CAI, 2019)

Weighted parsing for grammar-based language models. - Richard Mörbitz; Heiko Vogler (FSMNLP, 2019)

Regular transductions with MCFG input syntax. - Mark-Jan Nederhof; Heiko Vogler (FSMNLP, 2019)

Weighted iterated linear control. - Zoltán Fülöp 001; Heiko Vogler (Acta Informatica, 2019)

Weighted automata with storage. - Luisa Herrmann 001; Heiko Vogler; Manfred Droste (Inf. Comput., 2019)

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (DCFS, 2020)

A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. - Joost Engelfriet; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2020)

Crisp-determinization of weighted tree automata over strong bimonoids. - Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Discret. Math. Theor. Comput. Sci., 2021)

Weighted parsing for grammar-based language models over multioperator monoids. - Richard Mörbitz; Heiko Vogler (Inf. Comput., 2021)

Weighted Tree Automata - May it be a little more? - Zoltán Fülöp 001; Heiko Vogler (CoRR, 2022)

Preface. - Manfred Droste; Andreas Maletti; Heiko Vogler (Inf. Comput., 2022)

Principal abstract families of weighted tree languages. - Zoltán Fülöp 001; Heiko Vogler (Inf. Comput., 2022)

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. - Manfred Droste; Zoltán Fülöp 001; Dávid Kószó; Heiko Vogler (Theor. Comput. Sci., 2022)

A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids. - Maryam Ghorani; Heiko Vogler (New Math. Nat. Comput., 2023)

Hybrid tree automata and the yield theorem for constituent tree automata. - Frank Drewes; Richard Mörbitz; Heiko Vogler (Theor. Comput. Sci., 2023)

The generating power of weighted tree automata with initial algebra semantics. - Manfred Droste; Zoltán Fülöp 001; Andreja Tepavcevic; Heiko Vogler (CoRR, 2024)

A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. - Zoltán Fülöp 001; Heiko Vogler (Int. J. Found. Comput. Sci., 2024)