Logics and Automata for Totally Ordered Trees

DOI10.1007/978-3-540-70590-1_15zbMath1146.68045OpenAlexW1553779897MaRDI QIDQ3522020

Joachim Niehren, Marco Kuhlmann

Publication date: 28 August 2008

Published in: Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70590-1_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items

Hybrid tree automata and the yield theorem for constituent tree automata

Cites Work

• Unnamed Item
• Unnamed Item
• Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects
• Handbook of Graph Grammars and Computing by Graph Transformation
• Monadic datalog and the expressive power of languages for Web information extraction
• Algebraic automata and context-free sets
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Rewriting Techniques and Applications