Tree Automata and Automata on Linear Orderings

DOI10.1051/ita/2009009zbMath1166.68022OpenAlexW4300013286MaRDI QIDQ3625696

Olivier Carton, Véronique Bruyère, Géraud Sénizergues

Publication date: 6 May 2009

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92919

zbMATH Keywords

monadic second-order logictreesfinite automatawords over linear orderings

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items

AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS

Cites Work

• Automata on linear orderings
• On frontiers of regular trees
• COMPLEMENTATION OF RATIONAL SETS ON COUNTABLE SCATTERED LINEAR ORDERINGS
• Decidability of Second-Order Theories and Automata on Infinite Trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item