Construction of Tree Automata from Regular Expressions

DOI10.1007/978-3-540-85780-8_39MaRDI QIDQ3533035zbMATH OpenOpenAlexFDO

Authors Ingmar Meinecke, Dietrich Kuske

Publication date 30 October 2008

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL http://www.numdam.org/item?id=ITA_2011__45_3_347_0/

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Construction of tree automata from regular expressions
• Tree automata constructions from regular expressions: a comparative study
• scientific article; zbMATH DE number 3990873
• From regular tree expression to position tree automaton
• An optimal construction of finite automata from regular expressions
• From regular expressions to finite automata^∗
• From regular expressions to deterministic automata
• Regular expressions into finite automata
• scientific article; zbMATH DE number 1615227
• Tree automata

Cites work

• Canonical derivatives, partial derivatives and finite automaton constructions.
• Derivatives of Regular Expressions
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• From regular expressions to deterministic automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• scientific article; zbMATH DE number 5643878 (Why is no real title available?)
• scientific article; zbMATH DE number 2087060 (Why is no real title available?)
• scientific article; zbMATH DE number 3251424 (Why is no real title available?)
• Implementation and Application of Automata
• Implementation and Application of Automata
• Partial derivatives of regular expressions and finite automaton constructions
• Regular expression pattern matching for XML
• THE ABSTRACT THEORY OF AUTOMATA
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

Cited in

(7)

• The bottom-up position tree automaton and its compact version
• Construction of tree automata from regular expressions
• A Kleene Theorem for Forest Languages
• Hedge Pattern Partial Derivative
• Tree automata constructions from regular expressions: a comparative study
• From tree automata to rational tree expressions
• The bottom-up position tree automaton and the father automaton

This page was built for publication: Construction of Tree Automata from Regular Expressions

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