Construction of Tree Automata from Regular Expressions

DOI10.1007/978-3-540-85780-8_39zbMath1159.68018OpenAlexW1510936503MaRDI QIDQ3533035

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)

Related Items (2)

Hedge Pattern Partial Derivative ⋮ Construction of tree automata from regular expressions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• From regular expressions to deterministic automata
• Partial derivatives of regular expressions and finite automaton constructions
• Canonical derivatives, partial derivatives and finite automaton constructions.
• THE ABSTRACT THEORY OF AUTOMATA
• FROM C-CONTINUATIONS TO NEW QUADRATIC ALGORITHMS FOR AUTOMATON SYNTHESIS
• Regular expression pattern matching for XML
• Implementation and Application of Automata
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Derivatives of Regular Expressions
• Implementation and Application of Automata
• Translating regular expressions into small \(\epsilon\)-free nondeterministic finite automata

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