scientific article; zbMATH DE number 1499098

MaRDI QIDQ4501152zbMATH OpenFDO

Authors Bakhadyr Khoussainov, Anil Nerode

Publication date 3 September 2000

zbMATH Keywords

decidabilitygeneralized rankgame-theoretic methodssecond-order monadic theory of two successors

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving topology, set theory, or logic (91A44) Decidability of theories and sets of sentences (03B25)

Recommendations

• scientific article; zbMATH DE number 2206111
• scientific article; zbMATH DE number 3983141
• How unprovable is Rabin's decidability theorem?
• An algebraic proof of Rabin's tree theorem
• Expository notes on computability and complexity in (arithmetical) games

Cited in

(13)

• The isomorphism problem on classes of automatic structures with transitive relations
• Robust learning of automatic classes of languages
• Addition machines, automatic functions and open problems of Floyd and Knuth
• Ranking games that have competitiveness-based strategies
• The isomorphism problem for tree-automatic ordinals with addition
• scientific article; zbMATH DE number 2206111 (Why is no real title available?)
• Automatic models of first order theories
• Graphs are not universal for online computability
• Automatic presentations and semigroup constructions
• An example of an automatic graph of intermediate growth
• Algebraic structures computable without delay
• Online presentations of finitely generated structures
• scientific article; zbMATH DE number 7407778 (Why is no real title available?)

This page was built for publication:

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