Three Lectures on Automatic Structures

zbMath1228.03017arXiv0809.3430MaRDI QIDQ3079695

Mia Minnes, Bakhadyr Khoussainov

Publication date: 2 March 2011

Full work available at URL: https://arxiv.org/abs/0809.3430

zbMATH Keywords

computable structuresBorel structuretree automatic structureBüchi automatic structureRabin automatic structure

Mathematics Subject Classification ID

Descriptive set theory (03E15) Automata and formal grammars in connection with logical questions (03D05) Computable structure theory, computable model theory (03C57)

Related Items

Tree-automatic scattered linear orders ⋮ Learning pattern languages over groups ⋮ Lamplighter groups and automata ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ Alternating automatic register machines ⋮ String compression in FA-presentable structures ⋮ Effective categoricity of automatic equivalence and nested equivalence structures ⋮ Deciding the isomorphism problem in classes of unary automatic structures ⋮ Online presentations of finitely generated structures ⋮ Unnamed Item ⋮ On automaton presentations of projective planes ⋮ Automatic learning of subclasses of pattern languages ⋮ Unnamed Item ⋮ From automatic structures to automatic groups. ⋮ The isomorphism problem for tree-automatic ordinals with addition ⋮ Learners based on transducers ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Analysing Complexity in Classes of Unary Automatic Structures ⋮ Cayley Automatic Groups and Numerical Characteristics of Turing Transducers ⋮ On the width of regular classes of finite structures ⋮ Automata on Ordinals and Linear Orders ⋮ Learning Pattern Languages over Groups ⋮ On decidability of list structures ⋮ Searching for applicable versions of computable structures

This page was built for publication: Three Lectures on Automatic Structures