scientific article; zbMATH DE number 1499098

MaRDI QIDQ4501152zbMATH OpenFDO

Authors Bakhadyr Khoussainov, Anil Nerode

Publication date 3 September 2000

zbMATH Keywords

decidabilitygame-theoretic methodsgeneralized ranksecond-order monadic theory of two successors

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) 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)

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)

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

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)