Pages that link to "Item:Q5310687"
From MaRDI portal
The following pages link to Automatic Structures: Richness and Limitations (Q5310687):
Displaying 31 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Automatic models of first order theories (Q387121) (← links)
- On automaton presentations of projective planes (Q467658) (← links)
- Algebraic structures computable without delay (Q528478) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- The isomorphism relation between tree-automatic structures (Q707994) (← links)
- Ehrenfeucht-Fraïssé goes automatic for real addition (Q710741) (← links)
- Semi-synchronous transductions (Q1006891) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- Complexity and categoricity of injection structures induced by finite state transducers (Q2117771) (← links)
- Automata model for verifying attibuted-based access control policy in systems with a finite number of objects (Q2131407) (← links)
- The isomorphism problem for FST injection structures (Q2151392) (← links)
- Effective categoricity of automatic equivalence and nested equivalence structures (Q2195573) (← links)
- Model-theoretic properties of \(\omega\)-automatic structures (Q2254518) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Injection Structures Specified by Finite State Transducers (Q2970970) (← links)
- Isomorphism of Regular Trees and Words (Q3012921) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← links)
- Unary Automatic Graphs: An Algorithmic Perspective (Q3502677) (← links)
- Automata and Answer Set Programming (Q3605538) (← links)
- Path Feasibility Analysis for String-Manipulating Programs (Q3617764) (← links)
- Analysing Complexity in Classes of Unary Automatic Structures (Q3618610) (← links)
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES (Q5207571) (← links)
- Pumping for ordinal-automatic structures1 (Q5283444) (← links)
- A hierarchy of tree-automatic structures (Q5388735) (← links)
- Tree-Automatic Well-Founded Trees (Q5891703) (← links)
- Learners based on transducers (Q5918614) (← links)
- Word automatic groups of nilpotency class 2 (Q6072210) (← links)
