Tree Automata Make Ordinal Theory Easy

DOI10.1007/11944836_27MaRDI QIDQ5385993zbMATH OpenOpenAlexFDO

Authors Thierry Cachat

Publication date 17 April 2008

Published in FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11944836_27

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• The isomorphism problem for tree-automatic ordinals with addition
• Exact complexity bounds for ordinal addition
• Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• scientific article; zbMATH DE number 2087209

Cited in

(7)

• Reverse mathematics and well-ordering principles: a pilot study
• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
• The isomorphism problem for tree-automatic ordinals with addition
• scientific article; zbMATH DE number 5354049 (Why is no real title available?)
• Ehrenfeucht games, the composition method, and the monadic theory of ordinal words
• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• Exact complexity bounds for ordinal addition

This page was built for publication: Tree Automata Make Ordinal Theory Easy

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