From Tree Automata to Rational Tree Expressions

DOI10.1142/S012905411850020XzbMath1402.68117OpenAlexW2895057452WikidataQ129133328 ScholiaQ129133328MaRDI QIDQ4963267

Younes Guellouma, Hadda Cherroun

Publication date: 1 November 2018

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411850020x

zbMATH Keywords

rational expressionrational equationtree automata theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Superassociative structures of terms and formulas defined by transformations preserving a partition

Uses Software

• Tiburon

Cites Work

• Unnamed Item
• Equational tree transformations
• Partial derivatives of regular expressions and finite automaton constructions
• Axiomatizing the equational theory of regular tree languages
• On the minimization of XML schemas and tree automata for unranked trees
• Equational elements in additive algebras
• STACS 2004. 21st annual symposium on theoretical aspects of computer science, Montpellier, France, March 25--27, 2004. Proceedings.
• Construction of tree automata from regular expressions
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• From Regular Tree Expression to Position Tree Automaton
• Applications of Weighted Automata in Natural Language Processing
• An Efficient Algorithm for the Equation Tree Automaton via the k-C-Continuations
• Monodic Tree Kleene Algebra
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Tiburon: A Weighted Tree Automata Toolkit
• Implementation and Application of Automata