From regular tree expression to position tree automaton

DOI10.1007/978-3-642-37064-9_35MaRDI QIDQ4910478zbMATH OpenOpenAlexFDO

Authors E. Laugerotte, Nadia Ouali Sebti, Djelloul Ziadi

Publication date 18 March 2013

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-37064-9_35

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Tree automata constructions from regular expressions: a comparative study
• \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
• The bottom-up position tree automaton and its compact version
• The bottom-up position tree automaton and the father automaton
• Construction of tree automata from regular expressions

Cited in

(10)

• The bottom-up position tree automaton and its compact version
• Isomorphism of regular trees and words
• Construction of tree automata from regular expressions
• Construction of Tree Automata from Regular Expressions
• Tree pattern matching from regular tree expressions.
• Tree automata constructions from regular expressions: a comparative study
• An efficient algorithm for the construction of the equation tree automaton
• From tree automata to rational tree expressions
• \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
• The bottom-up position tree automaton and the father automaton

This page was built for publication: From regular tree expression to position tree automaton

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910478)