A Kleene Theorem for Forest Languages

DOI10.1007/978-3-642-00982-2_61zbMath1234.68241OpenAlexW2117809804MaRDI QIDQ3618626

Lutz Straßburger

Publication date: 2 April 2009

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-00982-2_61

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Kleene and Büchi theorems for weighted forest languages over M-monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the minimization of XML schemas and tree automata for unranked trees
• Properties of substitutions and unifications
• Morphismes et bimorphismes d'arbres
• A Kleene theorem for weighted tree automata
• The Kleene-Schützenberger theorem for formal power series in partially commuting variables.
• Algebraic recognizability of regular tree languages
• On the definition of a family of automata
• Forest Expressions
• Bottom-up and top-down tree transformations— a comparison
• A Characterization of Machine Mappings
• Generalized finite automata theory with an application to a decision problem of second-order logic
• FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES