Automatic structures: twenty years later
From MaRDI portal
Recommendations
Cited in
(20)- Symbolic automatic relations and their applications to SMT and CHC solving
- Second-order finite automata
- Lamplighter groups and automata
- Automatic structures
- A computation model with automatic functions and relations as primitive operations
- String compression in FA-presentable structures
- Three lectures on automatic structures
- scientific article; zbMATH DE number 2040323 (Why is no real title available?)
- Addition machines, automatic functions and open problems of Floyd and Knuth
- Ramsey quantifiers over automatic structures: complexity and applications to verification
- Quasi-isometric reductions between infinite strings
- The theory of reachability of trace-pushdown systems
- A class of rational trace relations closed under composition
- Computable classifications of continuous, transducer, and regular functions
- Existential definability of unary predicates in Büchi arithmetic
- Paths, ends and the separation problem for infinite graphs
- An introduction to the theory of linear integer arithmetic (invited paper)
- Games with -automatic preference relations
- Word structures and their automatic presentations
- Karp's NP-complete problems over first-order definable structures
This page was built for publication: Automatic structures: twenty years later
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145615)