Heiko Vogler

According to our database1, Heiko Vogler authored at least 86 papers between 1984 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Characterizations of recognizable weighted tree languages by logic and bimorphisms.
Soft Comput., 2018

Weighted Regular Tree Grammars with Storage.
Discrete Mathematics & Theoretical Computer Science, 2018

2017
Weighted Regular Tree Grammars with Storage.
CoRR, 2017

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures.
Computational Linguistics, 2017

2016
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages.
Journal of Automata, Languages and Combinatorics, 2016

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem.
Proceedings of the Language and Automata Theory and Applications, 2016

Weighted Symbolic Automata with Data Storage.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Characterizing weighted MSO for trees by branching transitive closure logics.
Theor. Comput. Sci., 2015

A Chomsky-Schützenberger Theorem for Weighted Automata with Storage.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics.
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Preface.
Theor. Comput. Sci., 2014

Tree parsing for tree-adjoining machine translation.
J. Log. Comput., 2014

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages.
Int. J. Found. Comput. Sci., 2014

Forward and backward application of symbolic tree transducers.
Acta Inf., 2014

Hybrid Grammars for Discontinuous Parsing.
Proceedings of the COLING 2014, 2014

2013
The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

General binarization for parsing and translation.
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012
Weighted automata and multi-valued logics over arbitrary bounded lattices.
Theor. Comput. Sci., 2012

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.
Theory Comput. Syst., 2012

Forward and Backward Application of Symbolic Tree Transducers
CoRR, 2012

Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics
CoRR, 2012

The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages
CoRR, 2012

Synchronous Context-Free Tree Grammars.
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Weighted Logics for Unranked Tree Automata.
Theory Comput. Syst., 2011

Weighted Extended Tree Transducers.
Fundam. Inform., 2011

Tree Parsing with Synchronous Tree-Adjoining Grammars.
Proceedings of the 12th International Conference on Parsing Technologies, 2011

2010
Determinization of Weighted Tree Automata Using Factorizations.
Journal of Automata, Languages and Combinatorics, 2010

Weighted finite automata over strong bimonoids.
Inf. Sci., 2010

Determinization of weighted finite automata over strong bimonoids.
Inf. Sci., 2010

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Efficient Inference through Cascades of Weighted Tree Transducers.
Proceedings of the ACL 2010, 2010

Preservation of Recognizability for Synchronous Tree Substitution Grammars.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

A Decoder for Probabilistic Synchronous Tree Insertion Grammars.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

n-Best Parsing Revisited.
Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009
A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.
Theory Comput. Syst., 2009

Decomposition of Weighted multioperator Tree Automata.
Int. J. Found. Comput. Sci., 2009

Bisimulation Minimisation of Weighted Automata on Unranked Trees.
Fundam. Inform., 2009

Compositions of Top-Down Tree Transducers with epsilon-Rules.
Proceedings of the Finite-State Methods and Natural Language Processing, 2009

2008
Weighted monadic datalog.
Theor. Comput. Sci., 2008

Weighted automata with discounting.
Inf. Process. Lett., 2008

A note on cut-worthiness of recognizable tree series.
Fuzzy Sets and Systems, 2008

2007
Learning Deterministically Recognizable Tree Series.
Journal of Automata, Languages and Combinatorics, 2007

2006
Weighted tree automata and weighted logics.
Theor. Comput. Sci., 2006

Cut sets as recognizable tree languages.
Fuzzy Sets and Systems, 2006

2005
Linear deterministic multi bottom-up tree transducers.
Theor. Comput. Sci., 2005

A Kleene Theorem for Weighted Tree Automata.
Theory Comput. Syst., 2005

Incomparability Results for Classes of Polynomial Tree Series Transformations.
Journal of Automata, Languages and Combinatorics, 2005

2004
Hierarchies of tree series transformations.
Theor. Comput. Sci., 2004

Syntactic composition of top-down tree transducers is short cut fusion.
Mathematical Structures in Computer Science, 2004

Weighted Tree Transducers.
Journal of Automata, Languages and Combinatorics, 2004

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.
Inf. Process. Lett., 2004

Relationally defined clones of tree functions closed under selection or primitive recursion.
Acta Cybern., 2004

2003
Tree Series Transformations that Respect Copying.
Theory Comput. Syst., 2003

Editorial.
Journal of Automata, Languages and Combinatorics, 2003

Determinization of Finite State Weighted Tree Automata.
Journal of Automata, Languages and Combinatorics, 2003

2002
Bottom-Up and Top-Down Tree Series Transformations.
Journal of Automata, Languages and Combinatorics, 2002

2001
The Universality of Higher-Order Attributed Tree Transducers.
Theory Comput. Syst., 2001

1999
A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers.
Theory Comput. Syst., 1999

1998
Syntax-Directed Semantics - Formal Models Based on Tree Transducers
Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-642-72248-6, 1998

The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers.
J. Comput. Syst. Sci., 1998

Attributed Context-Free Hypergraph Grammars.
Journal of Automata, Languages and Combinatorics, 1998

1997
Benefits of Hypergraphs for Program Transformation.
Proceedings of the Informatik '97, 1997

1996
Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers.
Journal of Functional and Logic Programming, 1996

1994
The Translation Power of Top-Down Tree-to-Graph Transducers.
J. Comput. Syst. Sci., 1994

Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars.
Fundam. Inform., 1994

A Pumping Lemma for Output Languages of Attributed Tree Transducers.
Acta Cybern., 1994

A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing.
Acta Cybern., 1994

Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic.
Acta Inf., 1994

1993
Tree Transducers with External Functions.
Theor. Comput. Sci., 1993

1992
An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines.
Formal Asp. Comput., 1992

1991
Modular Tree Transducers.
Theor. Comput. Sci., 1991

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

1988
The OI-Hierarchy Is Closed under Control
Inf. Comput., September, 1988

High Level Tree Transducers and Iterated Pushdown Tree Transducers.
Acta Inf., 1988

1987
Look-Ahead on Pushdowns
Inf. Comput., June, 1987

Basic Tree Transducers.
J. Comput. Syst. Sci., 1987

1986
Corrigenda: Pushdown Machines for the Macro Tree Tranducer.
Theor. Comput. Sci., 1986

Pushdown Machines for the Macro Tree Transducer.
Theor. Comput. Sci., 1986

Iterated Linear Control and Iterated One-Turn Pushdowns.
Mathematical Systems Theory, 1986

The OI-Hierarchy is Closed under Control.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

Basic Tree Transducers.
Proceedings of the CAAP '86, 1986

1985
Macro Tree Transducers.
J. Comput. Syst. Sci., 1985

Characterization of High Level Tree Transducers.
Proceedings of the Automata, 1985

Iterated linear control and iterated one-turn pushdowns.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Regular Characterizations of Macro Tree Transducers.
Proceedings of the CAAP'84, 1984


  Loading...