Word structures and their automatic presentations
From MaRDI portal
Cites work
- ^0_1-presentations of algebras
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Automata Presenting Structures: A Survey of the Finite String Case
- Automata theory and its applications
- Automata-based presentations of infinite structures
- Automatic Equivalence Structures of Polynomial Growth.
- Automatic presentations of structures
- Automatic Structures: Richness and Limitations
- Automatic structures: twenty years later
- Automaticity of ordinals and of homogeneous graphs
- Cardinality and counting quantifiers on omega-automatic structures
- Cayley automatic representations of wreath products
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
- Decidability of Second-Order Theories and Automata on Infinite Trees
- FA-presentable groups and rings
- Finite Automata Presentable Abelian Groups
- Finite presentations of infinite structures: Automata and interpretations
- Finitely generated semiautomatic groups
- Foundations of Software Science and Computation Structures
- From automatic structures to automatic groups.
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 545277 (Why is no real title available?)
- scientific article; zbMATH DE number 2040323 (Why is no real title available?)
- scientific article; zbMATH DE number 1747445 (Why is no real title available?)
- scientific article; zbMATH DE number 3261751 (Why is no real title available?)
- scientific article; zbMATH DE number 3266609 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Logical Reversibility of Computation
- Model-theoretic complexity of automatic structures
- On automatic transitive graphs
- Recursively enumerable reals and Chaitin \(\Omega\) numbers
- Reducibilities among equivalence relations induced by recursively enumerable structures
- Semiautomatic structures
- STACS 2004
- STACS 2005
- String compression in FA-presentable structures
- The additive group of the rationals does not have an automatic presentation
- The isomorphism problem for tree-automatic ordinals with addition
- The isomorphism problem on classes of automatic structures with transitive relations
- Tree-automatic scattered linear orders
- Unary Automatic Graphs: An Algorithmic Perspective
- Weak Second‐Order Arithmetic and Finite Automata
This page was built for publication: Word structures and their automatic presentations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310224)
