| Publication | Date of Publication | Type |
|---|
Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Weighted bottom-up and top-down tree transformations are incomparable
Implementation and Application of Automata | 2024-02-28 | Paper |
Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
International Journal of Foundations of Computer Science | 2024-02-16 | Paper |
Weighted tree automata with constraints
Theory of Computing Systems | 2024-02-09 | Paper |
Weighted two-way transducers
Information and Computation | 2024-02-02 | Paper |
Ambiguity Hierarchies for Weighted Tree Automata
International Journal of Foundations of Computer Science | 2023-11-24 | Paper |
Compositions with Constant Weighted Extended Tree Transducers
International Journal of Foundations of Computer Science | 2023-10-13 | Paper |
Combinatory categorial grammars as generators of weighted forests
Information and Computation | 2023-09-27 | Paper |
Weighted two-way transducers
Algebraic Informatics | 2023-07-26 | Paper |
| The Tree-Generative Capacity of Combinatory Categorial Grammars. | 2023-02-03 | Paper |
On Tree Substitution Grammars
Developments in Language Theory | 2022-10-13 | Paper |
| Weighted tree automata with constraints | 2022-08-11 | Paper |
| Compositions of constant weighted extended tree transducers | 2022-03-25 | Paper |
| Ambiguity hierarchies for weighted tree automata | 2022-03-22 | Paper |
The tree-generative capacity of combinatory categorial grammars
Journal of Computer and System Sciences | 2021-11-25 | Paper |
| scientific article; zbMATH DE number 7361973 (Why is no real title available?) | 2021-06-22 | Paper |
scientific article; zbMATH DE number 7361973 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-22 | Paper |
| Random generation of nondeterministic finite-state tree automata | 2021-06-17 | Paper |
Random generation of nondeterministic finite-state tree automata
(available as arXiv preprint) | 2021-06-17 | Paper |
| Composition closure of linear weighted extended top-down tree transducers | 2020-05-06 | Paper |
Compositions of tree-to-tree statistical machine translation models
International Journal of Foundations of Computer Science | 2018-09-20 | Paper |
Multiple context-free tree grammars: lexicalization and characterization
Theoretical Computer Science | 2018-05-17 | Paper |
Pushing for weighted tree automata
Logical Methods in Computer Science | 2018-01-23 | Paper |
| Multiple context-free tree grammars and multi-component tree adjoining grammars | 2017-11-22 | Paper |
Synchronous Forest Substitution Grammars
Acta Cybernetica | 2017-08-25 | Paper |
Survey: finite-state technology in natural language processing
Theoretical Computer Science | 2017-06-19 | Paper |
Composition closure of linear extended top-down tree transducers
Theory of Computing Systems | 2017-03-31 | Paper |
Compositions of Tree-to-Tree Statistical Machine Translation Models
Developments in Language Theory | 2016-08-30 | Paper |
| Notes on hyper-minimization | 2016-07-26 | Paper |
| Hyper-minimisation of deterministic weighted finite automata over semifields | 2016-07-26 | Paper |
Linking theorems for tree transducers
Journal of Computer and System Sciences | 2016-07-15 | Paper |
The power of weighted regularity-preserving multi bottom-up tree transducers
International Journal of Foundations of Computer Science | 2016-02-17 | Paper |
Hyper-optimization for deterministic tree automata
Theoretical Computer Science | 2015-05-18 | Paper |
The power of regularity-preserving multi bottom-up tree transducers
Implementation and Application of Automata | 2014-09-26 | Paper |
Book review of: Lance Fortnow, The golden ticket. P, NP, and the search for the impossible
European Mathematical Society Newsletter | 2014-04-30 | Paper |
Hyper-minimization for deterministic tree automata
International Journal of Foundations of Computer Science | 2014-03-10 | Paper |
Synchronous forest substitution grammars
Algebraic Informatics | 2013-09-20 | Paper |
Hyper-optimization for deterministic tree automata
Implementation and Application of Automata | 2013-08-07 | Paper |
Composition closure of \(\varepsilon \)-free linear extended top-down tree transducers
Developments in Language Theory | 2013-06-28 | Paper |
Unweighted and weighted hyper-minimization
International Journal of Foundations of Computer Science | 2013-06-06 | Paper |
Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars
Developments in Language Theory | 2012-11-02 | Paper |
Hyper-minimization for deterministic tree automata
Implementation and Application of Automata | 2012-09-20 | Paper |
Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
Acta Cybernetica | 2012-09-18 | Paper |
Weighted extended tree transducers
Fundamenta Informaticae | 2012-05-04 | Paper |
Survey: Weighted extended top-down tree transducers. II. Application in machine translation
Fundamenta Informaticae | 2012-05-04 | Paper |
MAT learners for tree series: an abstract data type and two realizations
Acta Informatica | 2012-03-23 | Paper |
THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
OPTIMAL HYPER-MINIMIZATION
International Journal of Foundations of Computer Science | 2012-03-13 | Paper |
Survey: Weighted extended top-down tree transducers. III. Composition
Algebraic Foundations in Computer Science | 2011-11-11 | Paper |
Tree transformations and dependencies
Lecture Notes in Computer Science | 2011-10-07 | Paper |
On minimising automata with errors
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Pushing for weighted tree automata
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Computing all \(\ell \)-cover automata fast
Implementation and Application of Automata | 2011-07-29 | Paper |
Simulations of weighted tree automata
Implementation and Application of Automata | 2011-02-11 | Paper |
Better hyper-minimization. Not as fast, but fewer errors
Implementation and Application of Automata | 2011-02-11 | Paper |
An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
Theoretical Computer Science | 2010-10-07 | Paper |
Input products for weighted extended top-down tree transducers
Developments in Language Theory | 2010-08-31 | Paper |
Properties of quasi-relabeling tree bimorphisms
International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
Minimizing deterministic weighted tree automata
Information and Computation | 2009-11-27 | Paper |
Extended multi bottom-up tree transducers
Acta Informatica | 2009-11-18 | Paper |
A Backward and a Forward Simulation for Weighted Tree Automata
Algebraic Informatics | 2009-11-05 | Paper |
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited
Algebraic Informatics | 2009-11-05 | Paper |
Backward and forward bisimulation minimization of tree automata
Theoretical Computer Science | 2009-09-14 | Paper |
A Kleene theorem for weighted tree automata over distributive multioperator monoids
Theory of Computing Systems | 2009-08-06 | Paper |
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
Implementation and Application of Automata | 2009-07-09 | Paper |
Bisimulation Minimisation of Weighted Automata on Unranked Trees
Fundamenta Informaticae | 2009-06-30 | Paper |
The Substitution Vanishes
Algebraic Methodology and Software Technology | 2009-04-28 | Paper |
Hierarchies of Tree Series Transformations Revisited
Developments in Language Theory | 2009-03-26 | Paper |
Tree-Series-to-Tree-Series Transformations
Implementation and Applications of Automata | 2009-02-12 | Paper |
Minimizing Deterministic Weighted Tree Automata
Language and Automata Theory and Applications | 2008-11-20 | Paper |
Extended Multi Bottom-Up Tree Transducers
Developments in Language Theory | 2008-10-30 | Paper |
Compositions of extended top-down tree transducers
Information and Computation | 2008-10-08 | Paper |
Learning Deterministically Recognizable Tree Series — Revisited
Algebraic Informatics | 2008-09-04 | Paper |
Backward and Forward Bisimulation Minimisation of Tree Automata
Implementation and Application of Automata | 2008-06-10 | Paper |
PURE AND O-SUBSTITUTION
International Journal of Foundations of Computer Science | 2008-05-20 | Paper |
Myhill-Nerode Theorem for Recognizable Tree Series Revisited
Lecture Notes in Computer Science | 2008-04-15 | Paper |
| Incomparability results for classes of polynomial tree series transformations | 2008-01-18 | Paper |
Bisimulation Minimisation for Weighted Tree Automata
Developments in Language Theory | 2007-11-28 | Paper |
Does o-Substitution Preserve Recognizability?
Implementation and Application of Automata | 2007-09-06 | Paper |
| scientific article; zbMATH DE number 5141494 (Why is no real title available?) | 2007-04-10 | Paper |
Compositions of tree series transformations
Theoretical Computer Science | 2007-01-09 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2006-06-23 | Paper |
Cut sets as recognizable tree languages
Fuzzy Sets and Systems | 2006-06-16 | Paper |
Developments in Language Theory
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
International Journal of Foundations of Computer Science | 2005-08-03 | Paper |
Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations
Theoretical Computer Science | 2005-06-30 | Paper |
