Tree Automata Make Ordinal Theory Easy

DOI10.1007/11944836_27zbMATH Open1177.03044OpenAlexW1562931435MaRDI QIDQ5385993FDOQ5385993

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

Recommendations

• The isomorphism problem for tree-automatic ordinals with addition
• Exact complexity bounds for ordinal addition
• scientific article; zbMATH DE number 1086492
• DETERMINISTIC AUTOMATA AND THE MONADIC THEORY OF ORDINALS < ω2
• scientific article; zbMATH DE number 2087209

Mathematics Subject Classification ID

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

Cited In (5)

• The \(\omega\)-inequality problem for concatenation hierarchies of star-free languages
• Complexity and (un)decidability of fragments of \(\langle \omega^{\omega^{\lambda}};\times\rangle\)
• The isomorphism problem for tree-automatic ordinals with addition
• Reverse mathematics and well-ordering principles: a pilot study
• Title not available (Why is that?)

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)