Semiautomatic structures
From MaRDI portal
Recommendations
Cites work
- Automatic functions, linear time and learning
- Automaticity of ordinals and of homogeneous graphs
- Cayley graph automatic groups are not necessarily Cayley graph biautomatic
- Describing Groups
- FA-presentable groups and rings
- Finite automata presentable Abelian groups
- Finitely generated semiautomatic groups
- From automatic structures to automatic groups.
- scientific article; zbMATH DE number 3841819 (Why is no real title available?)
- scientific article; zbMATH DE number 42574 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- scientific article; zbMATH DE number 3222127 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- Learning pattern languages over groups
- On Ordered Groups
- On the base-dependence of sets of numbers recognizable by finite automata
- Presburgerness of predicates regular in two number systems
- Semiautomatic structures
- STACS 2004
- The additive group of the rationals does not have an automatic presentation
Cited in
(9)- Lamplighter groups and automata
- Automatic structures
- String compression in FA-presentable structures
- Sequential Automatic Algebras
- Semiautomatic structures
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Addition machines, automatic functions and open problems of Floyd and Knuth
- Word structures and their automatic presentations
- Ordered semiautomatic rings with applications to geometry
This page was built for publication: Semiautomatic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1694004)