The Bottom-Up Position Tree Automaton and the Father Automaton

DOI10.1142/S0129054120420034zbMath1458.68082OpenAlexW3115172735MaRDI QIDQ5859662

Ludovic Mignot, Djelloul Ziadi, Samira Attou

Publication date: 19 April 2021

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

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

zbMATH Keywords

position automatontop-downbottom-upregular tree expressions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• LANGAGE

Cites Work

• Unnamed Item
• Unnamed Item
• Partial derivatives of regular expressions and finite automaton constructions
• Backward and forward bisimulation minimization of tree automata
• Follow automata.
• Characterization of Glushkov automata
• The bottom-up position tree automaton and its compact version
• On the mother of all automata: the position automaton
• Construction of tree automata from regular expressions
• THE ABSTRACT THEORY OF AUTOMATA
• On the Average Size of Glushkov’s Automata
• Tree Automata Constructions from Regular Expressions: a Comparative Study
• Bottom-Up Quotients for Tree Languages
• From Regular Tree Expression to Position Tree Automaton
• Mathematical Foundations of Computer Science 2004
• One-unambiguous regular languages
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata