scientific article

zbMath1169.03352MaRDI QIDQ3396632

Anil Nerode, Bakhadyr Khoussainov

Publication date: 19 September 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (24)

Tree-automatic scattered linear orders ⋮ Automatic models of first order theories ⋮ Automatic presentations of structures ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Uncountable automatic classes and learning ⋮ Online presentations of finitely generated structures ⋮ Isomorphisms of scattered automatic linear orders ⋮ On automaton presentations of projective planes ⋮ A hierarchy of tree-automatic structures ⋮ Automatic learning of subclasses of pattern languages ⋮ Algebraic structures computable without delay ⋮ Learnability of automatic classes ⋮ Eliminating unbounded search in computable algebra ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ Learners based on transducers ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ Punctual definability on structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Non-density in punctual computability ⋮ 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 ⋮ On decidability of list structures ⋮ PUNCTUAL CATEGORICITY AND UNIVERSALITY

This page was built for publication: