Pages that link to "Item:Q3503740"
From MaRDI portal
The following pages link to Automata Presenting Structures: A Survey of the Finite String Case (Q3503740):
Displaying 36 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Automatic models of first order theories (Q387121) (← links)
- On automaton presentations of projective planes (Q467658) (← links)
- Automatic learning of subclasses of pattern languages (Q690501) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
- Learning pattern languages over groups (Q1663643) (← links)
- Learnability of automatic classes (Q1757849) (← links)
- Lamplighter groups and automata (Q2170284) (← links)
- DEL-based epistemic planning: decidability and complexity (Q2211863) (← links)
- A language hierarchy of binary relations (Q2216121) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- On decidability of list structures (Q2332060) (← links)
- An example of an automatic graph of intermediate growth (Q2352257) (← links)
- Deciding the isomorphism problem in classes of unary automatic structures (Q2430013) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Automatic learners with feedback queries (Q2637649) (← links)
- A computation model with automatic functions and relations as primitive operations (Q2672645) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- Learning Pattern Languages over Groups (Q2830276) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Automatic Learners with Feedback Queries (Q3091438) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Automatic structures of bounded degree revisited (Q3107359) (← links)
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines (Q3172836) (← links)
- (Q3386623) (← links)
- A Hierarchy of Automatic<i>ω</i>-Words having a Decidable MSO Theory (Q3526410) (← links)
- Some natural decision problems in automatic graphs (Q3570167) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- Automatic Structures of Bounded Degree Revisited (Q3644760) (← links)
- (Q5013878) (← links)
- (Q5079723) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- Learners based on transducers (Q5918614) (← links)
- Clique‐convergence is undecidable for automatic graphs (Q6055401) (← links)
- Addition machines, automatic functions and open problems of Floyd and Knuth (Q6098150) (← links)
