scientific article; zbMATH DE number 5605134

MaRDI QIDQ3396632zbMATH OpenFDO

Authors Bakhadyr Khoussainov, Anil Nerode

Publication date 19 September 2009

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Computable structure theory, computable model theory (03C57) Automata and formal grammars in connection with logical questions (03D05)

Cited in

(25)

• Learnability of automatic classes
• Eliminating unbounded search in computable algebra
• Punctual definability on structures
• Non-density in punctual computability
• Effective categoricity of automatic equivalence and nested equivalence structures
• Online presentations of finitely generated structures
• The isomorphism problem for tree-automatic ordinals with addition
• On decidability of list structures
• Uncountable automatic classes and learning
• Isomorphisms of scattered automatic linear orders
• Tree-automatic scattered linear orders
• Cayley automatic groups and numerical characteristics of Turing transducers
• Decision Problems for Finite Automata over Infinite Algebraic Structures
• The isomorphism problem on classes of automatic structures with transitive relations
• Automatic models of first order theories
• On automaton presentations of projective planes
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Algebraic structures computable without delay
• A hierarchy of tree-automatic structures
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Learners based on transducers
• Automatic presentations of structures
• Automatic learning of subclasses of pattern languages
• Computable classifications of continuous, transducer, and regular functions
• Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals

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 Q3396632)