Simple classes of automatic structures
From MaRDI portal
Cites work
- A mathematical introduction to logic.
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Automatic Equivalence Structures of Polynomial Growth.
- Automatic linear orders and trees
- Automatic presentations of structures
- Automatic structures
- Automatic Structures: Richness and Limitations
- Automaticity of ordinals and of homogeneous graphs
- Characterizing regular languages with polynomial densities
- Every semilinear set is a finite union of disjoint linear sets
- FA-presentable groups and rings
- scientific article; zbMATH DE number 3767656 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1747445 (Why is no real title available?)
- Model Theory
- Model-theoretic properties of \(\omega\)-automatic structures
- On Cobham's theorem
- On direct products of automaton decidable theories
- On vector partition functions
- Presburger arithmetic, rational generating functions, and quasi-polynomials
- Rational sets in commutative monoids
- Semigroups, Presburger formulas, and languages
- Some natural decision problems in automatic graphs
- STACS 2004
- STACS 2005
- The additive group of the rationals does not have an automatic presentation
- Transforming structures by set interpretations
- Tree-automatic well-founded trees
This page was built for publication: Simple classes of automatic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6858372)
