Pages that link to "Item:Q3079695"
From MaRDI portal
The following pages link to Three Lectures on Automatic Structures (Q3079695):
Displaying 26 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- On automaton presentations of projective planes (Q467658) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- Searching for applicable versions of computable structures (Q2117745) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Online presentations of finitely generated structures (Q2205949) (← links)
- Automatic structures (Q2244823) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- On decidability of list structures (Q2332060) (← links)
- Deciding the isomorphism problem in classes of unary automatic structures (Q2430013) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (Q2817373) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- Automata on Ordinals and Linear Orders (Q3091463) (← links)
- (Q3386623) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- (Q5079723) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- Learners based on transducers (Q5918614) (← links)
- Addition machines, automatic functions and open problems of Floyd and Knuth (Q6098150) (← links)
- Decidability for Sturmian words (Q6597962) (← links)
