Pages that link to "Item:Q6064290"
From MaRDI portal
The following pages link to Automatic presentations of structures (Q6064290):
Displaying 11 items.
- Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
- Complexity and categoricity of injection structures induced by finite state transducers (Q2117771) (← links)
- Symbolic automatic relations and their applications to SMT and CHC solving (Q2145347) (← links)
- The isomorphism problem for FST injection structures (Q2151392) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- The back-and-forth method and computability without delay (Q2279959) (← links)
- On the width of regular classes of finite structures (Q2305404) (← links)
- On decidability of list structures (Q2332060) (← links)
- The inclusion structure of partially lossy queue monoids and their trace submonoids (Q4553833) (← links)
- Tree-Automatic Well-Founded Trees (Q5891703) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)