Heiko Vogler

Int. J. Found. Comput. Sci., 2024

2023

Hybrid tree automata and the yield theorem for constituent tree automata.

[BibT_eX]

[DOI]

Frank Drewes

Richard Mörbitz

Theor. Comput. Sci., November, 2023

A Theorem on Supports of Weighted Tree Automata Over Strong Bimonoids.

[BibT_eX]

[DOI]

Maryam Ghorani

New Math. Nat. Comput., July, 2023

2022

Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Principal abstract families of weighted tree languages.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Preface.

[BibT_eX]

[DOI]

Inf. Comput., 2022

Weighted Tree Automata - May it be a little more?

[BibT_eX]

[DOI]

CoRR, 2022

2021

Weighted parsing for grammar-based language models over multioperator monoids.

[BibT_eX]

[DOI]

Richard Mörbitz

Inf. Comput., 2021

Crisp-determinization of weighted tree automata over strong bimonoids.

[BibT_eX]

[DOI]

Dávid Kószó

Discret. Math. Theor. Comput. Sci., 2021

2020

A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Crisp-Determinization of Weighted Tree Automata over Additively Locally Finite and Past-Finite Monotonic Strong Bimonoids Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2020

2019

Weighted automata with storage.

[BibT_eX]

[DOI]

Inf. Comput., 2019

Weighted iterated linear control.

[BibT_eX]

[DOI]

Acta Informatica, 2019

Regular transductions with MCFG input syntax.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

Weighted parsing for grammar-based language models.

[BibT_eX]

[DOI]

Richard Mörbitz

Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

Rational Weighted Tree Languages with Storage and the Kleene-Goldstine Theorem.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 8th International Conference, 2019

2018

Characterizations of recognizable weighted tree languages by logic and bimorphisms.

[BibT_eX]

[DOI]

Soft Comput., 2018

Weighted Regular Tree Grammars with Storage.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

2017

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures.

[BibT_eX]

[DOI]

Kilian Gebhardt

Comput. Linguistics, 2017

2016

Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages.

[BibT_eX]

[DOI]

Markus Teichmann

J. Autom. Lang. Comb., 2016

A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2016

Weighted Symbolic Automata with Data Storage.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Characterizing weighted MSO for trees by branching transitive closure logics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

A Chomsky-Schützenberger Theorem for Weighted Automata with Storage.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics.

[BibT_eX]

[DOI]

Doreen Heusel

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Tree parsing for tree-adjoining machine translation.

[BibT_eX]

[DOI]

J. Log. Comput., 2014

The Chomsky-SCHüTzenberger Theorem for Quantitative Context-Free Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Forward and backward application of symbolic tree transducers.

[BibT_eX]

[DOI]

Acta Informatica, 2014

Hybrid Grammars for Discontinuous Parsing.

[BibT_eX]

[DOI]

Proceedings of the COLING 2014, 2014

2013

General binarization for parsing and translation.

[BibT_eX]

[DOI]

Alexander Koller

Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012

Weighted automata and multi-valued logics over arbitrary bounded lattices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Synchronous Context-Free Tree Grammars.

[BibT_eX]

[DOI]

Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011

Weighted Logics for Unranked Tree Automata.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

Weighted Extended Tree Transducers.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Tree Parsing with Synchronous Tree-Adjoining Grammars.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Parsing Technologies, 2011

2010

Determinization of Weighted Tree Automata Using Factorizations.

[BibT_eX]

[DOI]

Jonathan May

J. Autom. Lang. Comb., 2010

Weighted finite automata over strong bimonoids.

[BibT_eX]

[DOI]

Inf. Sci., 2010

Determinization of weighted finite automata over strong bimonoids.

[BibT_eX]

[DOI]

Inf. Sci., 2010

Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Efficient Inference through Cascades of Weighted Tree Transducers.

[BibT_eX]

[DOI]

Jonathan May

Kevin Knight

Proceedings of the ACL 2010, 2010

Preservation of Recognizability for Synchronous Tree Substitution Grammars.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

A Decoder for Probabilistic Synchronous Tree Insertion Grammars.

[BibT_eX]

[DOI]

Steve DeNeefe

Kevin Knight

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

n-Best Parsing Revisited.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2009

Decomposition of Weighted multioperator Tree Automata.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2009

Bisimulation Minimisation of Weighted Automata on Unranked Trees.

[BibT_eX]

[DOI]

Johanna Högberg

Fundam. Informaticae, 2009

Compositions of Top-Down Tree Transducers with <i>epsilon</i>-Rules.

[BibT_eX]

[DOI]

Proceedings of the Finite-State Methods and Natural Language Processing, 2009

2008

Weighted monadic datalog.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Weighted automata with discounting.

[BibT_eX]

[DOI]

Jacques Sakarovitch

Inf. Process. Lett., 2008

A note on cut-worthiness of recognizable tree series.

[BibT_eX]

[DOI]

Branimir Seselja

Andreja Tepavcevic

Fuzzy Sets Syst., 2008

2007

Learning Deterministically Recognizable Tree Series.

[BibT_eX]

[DOI]

Frank Drewes

J. Autom. Lang. Comb., 2007

2006

Weighted tree automata and weighted logics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Cut sets as recognizable tree languages.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2006

2005

Linear deterministic multi bottom-up tree transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Kleene Theorem for Weighted Tree Automata.

[BibT_eX]

[DOI]

Christian Pech

Theory Comput. Syst., 2005

Incomparability Results for Classes of Polynomial Tree Series Transformations.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

2004

Hierarchies of tree series transformations.

[BibT_eX]

[DOI]

Zsolt Gazdag

Theor. Comput. Sci., 2004

Syntactic composition of top-down tree transducers is short cut fusion.

[BibT_eX]

[DOI]

Claus Jürgensen

Math. Struct. Comput. Sci., 2004

Weighted Tree Transducers.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2004

A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Relationally defined clones of tree functions closed under selection or primitive recursion.

[BibT_eX]

[DOI]

Reinhard Pöschel

Alexander Semigrodskikh

Acta Cybern., 2004

2003

Tree Series Transformations that Respect Copying.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Determinization of Finite State Weighted Tree Automata.

[BibT_eX]

[DOI]

Björn Borchardt

J. Autom. Lang. Comb., 2003

2002

Bottom-Up and Top-Down Tree Series Transformations.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

2001

The Universality of Higher-Order Attributed Tree Transducers.

[BibT_eX]

[DOI]

Thomas Noll

Theory Comput. Syst., 2001

1999

A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers.

[BibT_eX]

[DOI]

Theory Comput. Syst., 1999

1998

Syntax-Directed Semantics - Formal Models Based on Tree Transducers

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1998

Attributed Context-Free Hypergraph Grammars.

[BibT_eX]

[DOI]

Sebastian Maneth

J. Autom. Lang. Comb., 1998

1997

Benefits of Hypergraphs for Program Transformation.

[BibT_eX]

[DOI]

Andrea Mößle

Proceedings of the Informatik '97, 1997

1996

Implementation of a Deterministic Partial E-Unification Algorithm for Macro Tree Transducers.

[BibT_eX]

[DOI]

Heinz Faßbender

Andrea Mößle

J. Funct. Log. Program., 1996

1994

The Translation Power of Top-Down Tree-to-Graph Transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Top-down Parsing with Simultaneous Evaluation of Noncircular Attribute Grammars.

[BibT_eX]

[DOI]

Thomas Noll

Fundam. Informaticae, 1994

A Pumping Lemma for Output Languages of Attributed Tree Transducers.

[BibT_eX]

[DOI]

Acta Cybern., 1994

A Universal Unification Algorithm Based on Unification-Driven Leftmost Outermost Narrowing.

[BibT_eX]

[DOI]

Heinz Faßbender

Acta Cybern., 1994

Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic.

[BibT_eX]

[DOI]

Acta Informatica, 1994

1993

Tree Transducers with External Functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

1992

An Implementation of Syntax Directed Functional Programming on Nested-Stack Machines.

[BibT_eX]

[DOI]

Heinz Faßbender

Formal Aspects Comput., 1992

1991

Modular Tree Transducers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Functional Description of the Contextual Analysis in Block-Structured Programming Languages: A Sase Study of Tree Transducers.

[BibT_eX]

[DOI]

Sci. Comput. Program., 1991

1988

The OI-Hierarchy Is Closed under Control

[BibT_eX]

[DOI]

Inf. Comput., September, 1988

High Level Tree Transducers and Iterated Pushdown Tree Transducers.

[BibT_eX]

[DOI]

Acta Informatica, 1988

1987

Look-Ahead on Pushdowns

[BibT_eX]

[DOI]

Inf. Comput., June, 1987

Basic Tree Transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

1986

<i>Corrigenda: </i> Pushdown Machines for the Macro Tree Tranducer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Pushdown Machines for the Macro Tree Transducer.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

Iterated Linear Control and Iterated One-Turn Pushdowns.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1986

1985

Macro Tree Transducers.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

Characterization of High Level Tree Transducers.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1985

1984

Regular Characterizations of Macro Tree Transducers.

[BibT_eX]