default search action
Heiko Vogler
Person information
- affiliation: Dresden University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j73]Frederic Dörband, Zoltán Fülöp, Heiko Vogler:
Rational weighted tree languages with storage. Inf. Comput. 301: 105205 (2024) - [j72]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): 51-76 (2024) - [i11]Manfred Droste, Zoltán Fülöp, Andreja Tepavcevic, Heiko Vogler:
The generating power of weighted tree automata with initial algebra semantics. CoRR abs/2405.20753 (2024) - [i10]Manfred Droste, Heiko Vogler:
Run supports and initial algebra supports of weighted automata. CoRR abs/2409.08727 (2024) - 2023
- [j71]Maryam Ghorani, Heiko Vogler:
A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids. New Math. Nat. Comput. 19(2): 579-594 (2023) - [j70]Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid tree automata and the yield theorem for constituent tree automata. Theor. Comput. Sci. 979: 114185 (2023) - 2022
- [j69]Manfred Droste, Andreas Maletti, Heiko Vogler:
Preface. Inf. Comput. 282: 104646 (2022) - [j68]Zoltán Fülöp, Heiko Vogler:
Principal abstract families of weighted tree languages. Inf. Comput. 282: 104657 (2022) - [j67]Manfred Droste, Zoltán Fülöp
, Dávid Kószó
Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids. Theor. Comput. Sci. 919: 118-143 (2022) - [c27]Frank Drewes, Richard Mörbitz, Heiko Vogler:
Hybrid Tree Automata and the Yield Theorem for Constituent Tree Automata. CIAA 2022: 93-105 - [i9]Zoltán Fülöp, Heiko Vogler:
Weighted Tree Automata - May it be a little more? CoRR abs/2212.05529 (2022) - 2021
- [j66]Zoltán Fülöp, Dávid Kószó
Crisp-determinization of weighted tree automata over strong bimonoids. Discret. Math. Theor. Comput. Sci. 23(1) (2021) - [j65]Richard Mörbitz, Heiko Vogler:
Weighted parsing for grammar-based language models over multioperator monoids. Inf. Comput. 281: 104774 (2021) - [i8]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 abs/2106.15867 (2021) - 2020
- [j64]Joost Engelfriet, Heiko Vogler:
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [c26]Manfred Droste, Zoltán Fülöp, Dávid Kószó
Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable. DCFS 2020: 39-51
2010 – 2019
- 2019
- [j63]Zoltán Fülöp, Heiko Vogler:
Weighted iterated linear control. Acta Informatica 56(5): 447-469 (2019) - [j62]Luisa Herrmann, Heiko Vogler, Manfred Droste:
Weighted automata with storage. Inf. Comput. 269 (2019) - [c25]Zoltán Fülöp, Heiko Vogler:
Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem. CAI 2019: 138-150 - [c24]Richard Mörbitz, Heiko Vogler:
Weighted parsing for grammar-based language models. FSMNLP 2019: 46-55 - [c23]Mark-Jan Nederhof, Heiko Vogler:
Regular transductions with MCFG input syntax. FSMNLP 2019: 56-64 - [e1]Heiko Vogler, Andreas Maletti:
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, FSMNLP 2019, Dresden, Germany, September 23-25, 2019. Association for Computational Linguistics 2019 [contents] - [i7]Joost Engelfriet, Heiko Vogler:
A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage. CoRR abs/1905.00559 (2019) - [i6]Richard Mörbitz, Heiko Vogler:
Weighted Parsing for Grammar-Based Language Models over Multioperator Monoids. CoRR abs/1911.06585 (2019) - [i5]Zoltán Fülöp, Dávid Kószó, Heiko Vogler:
Crisp-determinization of weighted tree automata over strong bimonoids. CoRR abs/1912.02660 (2019) - 2018
- [j61]Zoltán Fülöp, Luisa Herrmann, Heiko Vogler:
Weighted Regular Tree Grammars with Storage. Discret. Math. Theor. Comput. Sci. 20(1) (2018) - [j60]Zoltán Fülöp, Heiko Vogler:
Characterizations of recognizable weighted tree languages by logic and bimorphisms. Soft Comput. 22(4): 1035-1046 (2018) - 2017
- [j59]Kilian Gebhardt, Mark-Jan Nederhof
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. Comput. Linguistics 43(3): 465-520 (2017) - [i4]Zoltán Fülöp, Luisa Herrmann, Heiko Vogler:
Weighted Regular Tree Grammars with Storage. CoRR abs/1705.06681 (2017) - 2016
- [j58]Mark-Jan Nederhof
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. J. Autom. Lang. Comb. 21(3): 203-246 (2016) - [c22]Luisa Herrmann, Heiko Vogler:
Weighted Symbolic Automata with Data Storage. DLT 2016: 203-215 - [c21]Heiko Vogler, Manfred Droste, Luisa Herrmann:
A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. LATA 2016: 127-139 - 2015
- [j57]Zoltán Fülöp, Heiko Vogler:
Characterizing weighted MSO for trees by branching transitive closure logics. Theor. Comput. Sci. 594: 82-105 (2015) - [c20]Manfred Droste, Doreen Heusel, Heiko Vogler:
Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. CAI 2015: 90-102 - [c19]Luisa Herrmann, Heiko Vogler:
A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. CAI 2015: 115-127 - 2014
- [j56]Zoltán Fülöp, Heiko Vogler:
Forward and backward application of symbolic tree transducers. Acta Informatica 51(5): 297-325 (2014) - [j55]Manfred Droste, Heiko Vogler:
The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages. Int. J. Found. Comput. Sci. 25(8): 955-970 (2014) - [j54]Matthias Büchse, Heiko Vogler, Mark-Jan Nederhof
Tree parsing for tree-adjoining machine translation. J. Log. Comput. 24(2): 351-373 (2014) - [j53]Manfred Droste, Heiko Vogler:
Preface. Theor. Comput. Sci. 534: 1 (2014) - [c18]Mark-Jan Nederhof, Heiko Vogler:
Hybrid Grammars for Discontinuous Parsing. COLING 2014: 1370-1381 - 2013
- [c17]Matthias Büchse, Alexander Koller, Heiko Vogler:
General binarization for parsing and translation. ACL (1) 2013: 145-154 - [c16]Manfred Droste, Heiko Vogler:
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. Developments in Language Theory 2013: 203-214 - 2012
- [j52]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): 241-278 (2012) - [j51]Manfred Droste, Heiko Vogler:
Weighted automata and multi-valued logics over arbitrary bounded lattices. Theor. Comput. Sci. 418: 14-36 (2012) - [c15]Matthias Büchse, Andreas Maletti, Heiko Vogler:
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. Developments in Language Theory 2012: 368-379 - [c14]Mark-Jan Nederhof, Heiko Vogler:
Synchronous Context-Free Tree Grammars. TAG 2012: 55-63 - [i3]Manfred Droste, Heiko Vogler:
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. CoRR abs/1208.3942 (2012) - [i2]Zoltán Fülöp, Heiko Vogler:
Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics. CoRR abs/1208.5317 (2012) - [i1]Zoltán Fülöp, Heiko Vogler:
Forward and Backward Application of Symbolic Tree Transducers. CoRR abs/1208.5324 (2012) - 2011
- [j50]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Weighted Extended Tree Transducers. Fundam. Informaticae 111(2): 163-202 (2011) - [j49]Manfred Droste, Heiko Vogler:
Weighted Logics for Unranked Tree Automata. Theory Comput. Syst. 48(1): 23-47 (2011) - [c13]Matthias Büchse, Mark-Jan Nederhof, Heiko Vogler:
Tree Parsing with Synchronous Tree-Adjoining Grammars. IWPT 2011: 14-25 - 2010
- [j48]Manfred Droste, Torsten Stüber, Heiko Vogler:
Weighted finite automata over strong bimonoids. Inf. Sci. 180(1): 156-166 (2010) - [j47]Miroslav Ciric
Determinization of weighted finite automata over strong bimonoids. Inf. Sci. 180(18): 3497-3520 (2010) - [j46]Matthias Büchse, Jonathan May, Heiko Vogler:
Determinization of Weighted Tree Automata Using Factorizations. J. Autom. Lang. Comb. 15(3/4): 229-254 (2010) - [c12]Zoltán Fülöp, Andreas Maletti, Heiko Vogler:
Preservation of Recognizability for Synchronous Tree Substitution Grammars. ATANLP@ACL 2010 2010: 1-9 - [c11]Steve DeNeefe, Kevin Knight, Heiko Vogler:
A Decoder for Probabilistic Synchronous Tree Insertion Grammars. ATANLP@ACL 2010 2010: 10-18 - [c10]Matthias Büchse, Daniel Geisler, Torsten Stüber, Heiko Vogler:
n-Best Parsing Revisited. ATANLP@ACL 2010 2010: 46-54 - [c9]Jonathan May, Kevin Knight, Heiko Vogler:
Efficient Inference through Cascades of Weighted Tree Transducers. ACL 2010: 1058-1066 - [c8]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: 160-172
2000 – 2009
- 2009
- [j45]Johanna Högberg, Andreas Maletti, Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundam. Informaticae 92(1-2): 103-130 (2009) - [j44]Torsten Stüber, Heiko Vogler, Zoltán Fülöp:
Decomposition of Weighted multioperator Tree Automata. Int. J. Found. Comput. Sci. 20(2): 221-245 (2009) - [j43]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): 455-499 (2009) - [c7]Andreas Maletti, Heiko Vogler:
Compositions of Top-Down Tree Transducers with epsilon-Rules. FSMNLP 2009: 69-80 - 2008
- [j42]Branimir Seselja, Andreja Tepavcevic
A note on cut-worthiness of recognizable tree series. Fuzzy Sets Syst. 159(22): 3087-3090 (2008) - [j41]Manfred Droste, Jacques Sakarovitch, Heiko Vogler:
Weighted automata with discounting. Inf. Process. Lett. 108(1): 23-28 (2008) - [j40]Torsten Stüber, Heiko Vogler:
Weighted monadic datalog. Theor. Comput. Sci. 403(2-3): 221-238 (2008) - 2007
- [j39]Frank Drewes, Heiko Vogler:
Learning Deterministically Recognizable Tree Series. J. Autom. Lang. Comb. 12(3): 332-354 (2007) - [j38]Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 12(4): 433 (2007) - 2006
- [j37]Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic
Cut sets as recognizable tree languages. Fuzzy Sets Syst. 157(11): 1560-1571 (2006) - [j36]Manfred Droste, Heiko Vogler:
Weighted tree automata and weighted logics. Theor. Comput. Sci. 366(3): 228-247 (2006) - 2005
- [j35]Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 10(2/3): 105 (2005) - [j34]Andreas Maletti, Heiko Vogler:
Incomparability Results for Classes of Polynomial Tree Series Transformations. J. Autom. Lang. Comb. 10(4): 535-568 (2005) - [j33]Manfred Droste, Christian Pech
A Kleene Theorem for Weighted Tree Automata. Theory Comput. Syst. 38(1): 1-38 (2005) - [j32]Zoltán Fülöp, Armin Kühnemann, Heiko Vogler:
Linear deterministic multi bottom-up tree transducers. Theor. Comput. Sci. 347(1-2): 276-287 (2005) - 2004
- [j31]Reinhard Pöschel, Alexander Semigrodskikh, Heiko Vogler:
Relationally defined clones of tree functions closed under selection or primitive recursion. Acta Cybern. 16(3): 411-425 (2004) - [j30]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): 57-67 (2004) - [j29]Zoltán Fülöp, Heiko Vogler:
Weighted Tree Transducers. J. Autom. Lang. Comb. 9(1): 31-54 (2004) - [j28]Claus Jürgensen, Heiko Vogler:
Syntactic composition of top-down tree transducers is short cut fusion. Math. Struct. Comput. Sci. 14(2): 215-282 (2004) - [j27]Zoltán Fülöp, Zsolt Gazdag, Heiko Vogler:
Hierarchies of tree series transformations. Theor. Comput. Sci. 314(3): 387-429 (2004) - 2003
- [j26]Manfred Droste, Heiko Vogler:
Editorial. J. Autom. Lang. Comb. 8(2): 115 (2003) - [j25]Björn Borchardt, Heiko Vogler:
Determinization of Finite State Weighted Tree Automata. J. Autom. Lang. Comb. 8(3): 417-463 (2003) - [j24]Zoltán Fülöp, Heiko Vogler:
Tree Series Transformations that Respect Copying. Theory Comput. Syst. 36(3): 247-293 (2003) - 2002
- [j23]Joost Engelfriet, Zoltán Fülöp, Heiko Vogler:
Bottom-Up and Top-Down Tree Series Transformations. J. Autom. Lang. Comb. 7(1): 11-70 (2002) - 2001
- [j22]Thomas Noll
The Universality of Higher-Order Attributed Tree Transducers. Theory Comput. Syst. 34(1): 45-75 (2001)
1990 – 1999
- 1999
- [j21]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): 649-676 (1999) - 1998
- [b1]Zoltán Fülöp, Heiko Vogler:
Syntax-Directed Semantics - Formal Models Based on Tree Transducers. Monographs in Theoretical Computer Science. An EATCS Series, Springer 1998, ISBN 978-3-642-72250-9, pp. I-X, 1-273 - [j20]Sebastian Maneth, Heiko Vogler:
Attributed Context-Free Hypergraph Grammars. J. Autom. Lang. Comb. 3(2): 105-147 (1998) - [j19]Joost Engelfriet, Heiko Vogler:
The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 56(3): 332-356 (1998) - 1997
- [c6]Andrea Mößle, Heiko Vogler:
Benefits of Hypergraphs for Program Transformation. GI Jahrestagung 1997: 572-581 - 1996
- [j18]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) - 1994
- [j17]Armin Kühnemann, Heiko Vogler:
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic. Acta Informatica 31(5): 431-477 (1994) - [j16]Heinz Faßbender, Heiko Vogler:
A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing. Acta Cybern. 11(3): 139-167 (1994) - [j15]Armin Kühnemann, Heiko Vogler:
A Pumping Lemma for Output Languages of Attributed Tree Transducers. Acta Cybern. 11(4): 261-305 (1994) - [j14]Thomas Noll
Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars. Fundam. Informaticae 20(4): 285-332 (1994) - [j13]Joost Engelfriet, Heiko Vogler:
The Translation Power of Top-Down Tree-to-Graph Transducers. J. Comput. Syst. Sci. 49(2): 258-305 (1994) - 1993
- [j12]Zoltán Fülöp, Frank Herrmann, Sándor Vágvölgyi, Heiko Vogler:
Tree Transducers with External Functions. Theor. Comput. Sci. 108(2): 185-236 (1993) - 1992
- [j11]Heinz Faßbender, Heiko Vogler:
An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines. Formal Aspects Comput. 4(4): 341-375 (1992) - 1991
- [j10]Heiko Vogler:
Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers. Sci. Comput. Program. 16(3): 251-275 (1991) - [j9]Joost Engelfriet, Heiko Vogler:
Modular Tree Transducers. Theor. Comput. Sci. 78(2): 267-303 (1991)
1980 – 1989
- 1988
- [j8]Joost Engelfriet, Heiko Vogler:
High Level Tree Transducers and Iterated Pushdown Tree Transducers. Acta Informatica 26(1/2): 131-192 (1988) - [j7]Heiko Vogler:
The OI-Hierarchy Is Closed under Control. Inf. Comput. 78(3): 187-204 (1988) - 1987
- [j6]Joost Engelfriet, Heiko Vogler:
Look-Ahead on Pushdowns. Inf. Comput. 73(3): 245-279 (1987) - [j5]Heiko Vogler:
Basic Tree Transducers. J. Comput. Syst. Sci. 34(1): 87-128 (1987) - 1986
- [j4]Heiko Vogler:
Iterated Linear Control and Iterated One-Turn Pushdowns. Math. Syst. Theory 19(2): 117-133 (1986) - [j3]Joost Engelfriet, Heiko Vogler:
Pushdown Machines for the Macro Tree Transducer. Theor. Comput. Sci. 42: 251-368 (1986) - [j2]Joost Engelfriet, Heiko Vogler:
Corrigenda: Pushdown Machines for the Macro Tree Tranducer. Theor. Comput. Sci. 48(3): 339 (1986) - [c5]Heiko Vogler:
Basic Tree Transducers. CAAP 1986: 183-195 - [c4]Heiko Vogler:
The OI-Hierarchy is Closed under Control. MFCS 1986: 611-619 - 1985
- [j1]Joost Engelfriet, Heiko Vogler:
Macro Tree Transducers. J. Comput. Syst. Sci. 31(1): 71-146 (1985) - [c3]Heiko Vogler:
Iterated linear control and iterated one-turn pushdowns. FCT 1985: 474-483 - [c2]Joost Engelfriet, Heiko Vogler:
Characterization of High Level Tree Transducers. ICALP 1985: 171-178 - 1984
- [c1]Joost Engelfriet, Heiko Vogler:
Regular Characterizations of Macro Tree Transducers. CAAP 1984: 103-118
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-14 23:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: