scientific article; zbMATH DE number 1499098

zbMATH Open0946.03013MaRDI QIDQ4501152FDOQ4501152

Authors: Bakhadyr Khoussainov, Anil Nerode 

Publication date: 3 September 2000

Title of this publication is not available (Why is that?)

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

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)

Cited In (13)

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

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)