Publication:3396632
From MaRDI portal
zbMath1169.03352MaRDI QIDQ3396632
Anil Nerode, Bakhadyr Khoussainov
Publication date: 19 September 2009
03D05: Automata and formal grammars in connection with logical questions
03C13: Model theory of finite structures
03C57: Computable structure theory, computable model theory
Related Items
AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, A hierarchy of tree-automatic structures, Learners based on transducers, PUNCTUAL CATEGORICITY AND UNIVERSALITY, Automatic presentations of structures, Tree-automatic scattered linear orders, Automatic models of first order theories, On automaton presentations of projective planes, Algebraic structures computable without delay, Automatic learning of subclasses of pattern languages, Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals, 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, 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
