Tree automata constructions from regular expressions: a comparative study

DOI10.3233/FI-2017-1598MaRDI QIDQ4606264zbMATH OpenOpenAlexFDO

Authors Ludovic Mignot, Nadia Ouali Sebti, Djelloul Ziadi

Publication date 2 March 2018

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2017-1598

zbMATH Keywords

automata theoryc-continuationsderivativespartial derivativesregular tree expressiontree automata constructions

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• \(K\)-position, follow, equation and \(K\)-C-continuation tree automata constructions
• Construction of tree automata from regular expressions
• Construction of Tree Automata from Regular Expressions
• From tree automata to rational tree expressions
• From regular tree expression to position tree automaton

Cited in

(9)

• The bottom-up position tree automaton and its compact version
• Manipulation of regular expressions using derivatives: an overview
• Construction of tree automata from regular expressions
• Construction of Tree Automata from Regular Expressions
• From regular tree expression to position 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
• Combinatorial results to measure the complexity of quantifier free formulas in algebraic systems

This page was built for publication: Tree automata constructions from regular expressions: a comparative study

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