Heiko Vogler

Publication Activity (10 Years)

Years Active: 1984-2024
Publications (10 Years): 33

Top Venues

CoRR

Inf. Comput.

Theor. Comput. Sci.

CAI

Publications

Zoltán Fülöp, Heiko Vogler
A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic, Heiko Vogler
The generating power of weighted tree automata with initial algebra semantics. CoRR (2024)
Frederic Dörband, Zoltán Fülöp, Heiko Vogler
Rational weighted tree languages with storage. Inf. Comput. 301 (2024)
Frank Drewes, Richard Mörbitz, Heiko Vogler
Hybrid tree automata and the yield theorem for constituent tree automata. Theor. Comput. Sci. 979 (2023)
Maryam Ghorani, Heiko Vogler
A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids. New Math. Nat. Comput. 19 (2) (2023)
Manfred Droste, Andreas Maletti, Heiko Vogler
Preface. Inf. Comput. 282 (2022)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. Theor. Comput. Sci. 919 (2022)
Frank Drewes, Richard Mörbitz, Heiko Vogler
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA (2022)
Zoltán Fülöp, Heiko Vogler
Principal abstract families of weighted tree languages. Inf. Comput. 282 (2022)
Zoltán Fülöp, Heiko Vogler
Weighted Tree Automata - May it be a little more? CoRR (2022)
Richard Mörbitz, Heiko Vogler
Weighted parsing for grammar-based language models over multioperator monoids. Inf. Comput. 281 (2021)
Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-determinization of weighted tree automata over strong bimonoids. Discret. Math. Theor. Comput. Sci. 23 (1) (2021)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. CoRR (2021)
Joost Engelfriet, Heiko Vogler
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Manfred Droste, Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. DCFS (2020)
Joost Engelfriet, Heiko Vogler
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. CoRR (2019)
Zoltán Fülöp, Heiko Vogler
Weighted iterated linear control. Acta Informatica 56 (5) (2019)
Luisa Herrmann, Heiko Vogler, Manfred Droste
Weighted automata with storage. Inf. Comput. 269 (2019)
Zoltán Fülöp, Heiko Vogler
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. CAI (2019)
Mark-Jan Nederhof, Heiko Vogler
Regular transductions with MCFG input syntax. FSMNLP (2019)
Zoltán Fülöp, Dávid Kószó, Heiko Vogler
Crisp-determinization of weighted tree automata over strong bimonoids. CoRR (2019)
Richard Mörbitz, Heiko Vogler
Weighted parsing for grammar-based language models. FSMNLP (2019)
Richard Mörbitz, Heiko Vogler
Weighted Parsing for Grammar-Based Language Models over Multioperator Monoids. CoRR (2019)
Zoltán Fülöp, Heiko Vogler
Characterizations of recognizable weighted tree languages by logic and bimorphisms. Soft Comput. 22 (4) (2018)
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Weighted Regular Tree Grammars with Storage. Discret. Math. Theor. Comput. Sci. 20 (1) (2018)
Kilian Gebhardt, Mark-Jan Nederhof, Heiko Vogler
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. Comput. Linguistics 43 (3) (2017)
Zoltán Fülöp, Luisa Herrmann, Heiko Vogler
Weighted Regular Tree Grammars with Storage. CoRR (2017)
Luisa Herrmann, Heiko Vogler
Weighted Symbolic Automata with Data Storage. DLT (2016)
Heiko Vogler, Manfred Droste, Luisa Herrmann
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. LATA (2016)
Mark-Jan Nederhof, Markus Teichmann, Heiko Vogler
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. J. Autom. Lang. Comb. 21 (3) (2016)
Zoltán Fülöp, Heiko Vogler
Characterizing weighted MSO for trees by branching transitive closure logics. Theor. Comput. Sci. 594 (2015)
Manfred Droste, Doreen Heusel, Heiko Vogler
Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. CAI (2015)
Luisa Herrmann, Heiko Vogler
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. CAI (2015)
Mark-Jan Nederhof, Heiko Vogler
Hybrid Grammars for Discontinuous Parsing. COLING (2014)
Manfred Droste, Heiko Vogler
Preface. Theor. Comput. Sci. 534 (2014)
Zoltán Fülöp, Heiko Vogler
Forward and backward application of symbolic tree transducers. Acta Informatica 51 (5) (2014)
Manfred Droste, Heiko Vogler
The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages. Int. J. Found. Comput. Sci. 25 (8) (2014)
Matthias Büchse, Heiko Vogler, Mark-Jan Nederhof
Tree parsing for tree-adjoining machine translation. J. Log. Comput. 24 (2) (2014)
Matthias Büchse, Alexander Koller, Heiko Vogler
General binarization for parsing and translation. ACL (1) (2013)
Manfred Droste, Heiko Vogler
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. Developments in Language Theory (2013)
Zoltán Fülöp, Heiko Vogler
Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics CoRR (2012)
Manfred Droste, Heiko Vogler
Weighted automata and multi-valued logics over arbitrary bounded lattices. Theor. Comput. Sci. 418 (2012)
Manfred Droste, Heiko Vogler
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages CoRR (2012)
Zoltán Fülöp, Torsten Stüber, Heiko Vogler
A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. Theory Comput. Syst. 50 (2) (2012)
Zoltán Fülöp, Heiko Vogler
Forward and Backward Application of Symbolic Tree Transducers CoRR (2012)
Matthias Büchse, Andreas Maletti, Heiko Vogler
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. Developments in Language Theory (2012)
Mark-Jan Nederhof, Heiko Vogler
Synchronous Context-Free Tree Grammars. TAG (2012)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Weighted Extended Tree Transducers. Fundam. Informaticae 111 (2) (2011)
Matthias Büchse, Mark-Jan Nederhof, Heiko Vogler
Tree Parsing with Synchronous Tree-Adjoining Grammars. IWPT (2011)
Manfred Droste, Heiko Vogler
Weighted Logics for Unranked Tree Automata. Theory Comput. Syst. 48 (1) (2011)
Matthias Büchse, Jonathan May, Heiko Vogler
Determinization of Weighted Tree Automata Using Factorizations. J. Autom. Lang. Comb. 15 (3/4) (2010)
Manfred Droste, Heiko Vogler
Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. Developments in Language Theory (2010)
Matthias Büchse, Daniel Geisler, Torsten Stüber, Heiko Vogler
n-Best Parsing Revisited. ATANLP@ACL 2010 (2010)
Jonathan May, Kevin Knight, Heiko Vogler
Efficient Inference through Cascades of Weighted Tree Transducers. ACL (2010)
Manfred Droste, Torsten Stüber, Heiko Vogler
Weighted finite automata over strong bimonoids. Inf. Sci. 180 (1) (2010)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 (2010)
Miroslav Ciric, Manfred Droste, Jelena Ignjatovic, Heiko Vogler
Determinization of weighted finite automata over strong bimonoids. Inf. Sci. 180 (18) (2010)
Steve DeNeefe, Kevin Knight, Heiko Vogler
A Decoder for Probabilistic Synchronous Tree Insertion Grammars. ATANLP@ACL 2010 (2010)
Torsten Stüber, Heiko Vogler, Zoltán Fülöp
Decomposition of Weighted multioperator Tree Automata. Int. J. Found. Comput. Sci. 20 (2) (2009)
Johanna Högberg, Andreas Maletti, Heiko Vogler
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92 (1-2) (2009)
Andreas Maletti, Heiko Vogler
-Rules. FSMNLP (2009)
Zoltán Fülöp, Andreas Maletti, Heiko Vogler
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory Comput. Syst. 44 (3) (2009)
Branimir Seselja, Andreja Tepavcevic, Heiko Vogler
A note on cut-worthiness of recognizable tree series. Fuzzy Sets Syst. 159 (22) (2008)
Torsten Stüber, Heiko Vogler
Weighted monadic datalog. Theor. Comput. Sci. 403 (2-3) (2008)
Manfred Droste, Jacques Sakarovitch, Heiko Vogler
Weighted automata with discounting. Inf. Process. Lett. 108 (1) (2008)
Frank Drewes, Heiko Vogler
Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. 12 (3) (2007)
Manfred Droste, Heiko Vogler
Editorial. J. Autom. Lang. Comb. 12 (4) (2007)
Manfred Droste, Heiko Vogler
Weighted tree automata and weighted logics. Theor. Comput. Sci. 366 (3) (2006)
Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler
Cut sets as recognizable tree languages. Fuzzy Sets Syst. 157 (11) (2006)
Manfred Droste, Christian Pech, Heiko Vogler
A Kleene Theorem for Weighted Tree Automata. Theory Comput. Syst. 38 (1) (2005)
Manfred Droste, Heiko Vogler
Editorial. J. Autom. Lang. Comb. 10 (2/3) (2005)
Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347 (1-2) (2005)
Andreas Maletti, Heiko Vogler
Incomparability Results for Classes of Polynomial Tree Series Transformations. J. Autom. Lang. Comb. 10 (4) (2005)
Claus Jürgensen, Heiko Vogler
Syntactic composition of top-down tree transducers is short cut fusion. Math. Struct. Comput. Sci. 14 (2) (2004)
Zoltán Fülöp, Heiko Vogler
Weighted Tree Transducers. J. Autom. Lang. Comb. 9 (1) (2004)
Reinhard Pöschel, Alexander Semigrodskikh, Heiko Vogler
Relationally defined clones of tree functions closed under selection or primitive recursion. Acta Cybern. 16 (3) (2004)
Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler
Hierarchies of tree series transformations. Theor. Comput. Sci. 314 (3) (2004)
Zoltán Fülöp, Armin Kühnemann, Heiko Vogler
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91 (2) (2004)
Zoltán Fülöp, Heiko Vogler
Tree Series Transformations that Respect Copying. Theory Comput. Syst. 36 (3) (2003)
Manfred Droste, Heiko Vogler
Editorial. J. Autom. Lang. Comb. 8 (2) (2003)
Björn Borchardt, Heiko Vogler
Determinization of Finite State Weighted Tree Automata. J. Autom. Lang. Comb. 8 (3) (2003)
Joost Engelfriet, Zoltán Fülöp, Heiko Vogler
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7 (1) (2002)
Thomas Noll, Heiko Vogler
The Universality of Higher-Order Attributed Tree Transducers. Theory Comput. Syst. 34 (1) (2001)
Zoltán Fülöp, Heiko Vogler
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. Theory Comput. Syst. 32 (6) (1999)
Sebastian Maneth, Heiko Vogler
Attributed Context-Free Hypergraph Grammars. J. Autom. Lang. Comb. 3 (2) (1998)
Joost Engelfriet, Heiko Vogler
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 56 (3) (1998)
Andrea Mößle, Heiko Vogler
Benefits of Hypergraphs for Program Transformation. GI Jahrestagung (1997)
Heinz Faßbender, Andrea Mößle, Heiko Vogler
Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers. J. Funct. Log. Program. 1996 (2) (1996)
Armin Kühnemann, Heiko Vogler
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic. Acta Informatica 31 (5) (1994)
Thomas Noll, Heiko Vogler
Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars. Fundam. Informaticae 20 (4) (1994)
Heinz Faßbender, Heiko Vogler
A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing. Acta Cybern. 11 (3) (1994)
Armin Kühnemann, Heiko Vogler
A Pumping Lemma for Output Languages of Attributed Tree Transducers. Acta Cybern. 11 (4) (1994)
Joost Engelfriet, Heiko Vogler
The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49 (2) (1994)
Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler
Tree Transducers with External Functions. Theor. Comput. Sci. 108 (2) (1993)
Heinz Faßbender, Heiko Vogler
An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines. Formal Aspects Comput. 4 (4) (1992)
Joost Engelfriet, Heiko Vogler
Modular Tree Transducers. Theor. Comput. Sci. 78 (2) (1991)
Heiko Vogler
Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers. Sci. Comput. Program. 16 (3) (1991)
Heiko Vogler
The OI-Hierarchy Is Closed under Control Inf. Comput. 78 (3) (1988)
Joost Engelfriet, Heiko Vogler
High Level Tree Transducers and Iterated Pushdown Tree Transducers. Acta Informatica 26 (1/2) (1988)
Joost Engelfriet, Heiko Vogler
Look-Ahead on Pushdowns Inf. Comput. 73 (3) (1987)

Heiko Vogler.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Heiko Vogler