Semiautomatic structures

DOI10.1007/s00224-017-9792-7zbMath1420.03072OpenAlexW4251800046MaRDI QIDQ1694004

Frank Stephan, Sanjay Jain, Dan Teng, Bakhadyr Khoussainov, Siyuan Zou

Publication date: 1 February 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-017-9792-7

zbMATH Keywords

automata theorygroupsringsautomatic structuresbasic algebraic structuressemiautomatic structures

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Computable structure theory, computable model theory (03C57)

Related Items

Lamplighter groups and automata, Addition machines, automatic functions and open problems of Floyd and Knuth, String compression in FA-presentable structures, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata presentable Abelian groups
• FA-presentable groups and rings
• Presburgerness of predicates regular in two number systems
• Automaticity of ordinals and of homogeneous graphs
• From automatic structures to automatic groups.
• Learning Pattern Languages over Groups
• Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
• Automatic Functions, Linear Time and Learning
• The additive group of the rationals does not have an automatic presentation
• Finitely Generated Semiautomatic Groups
• Describing Groups
• Semiautomatic Structures
• STACS 2004
• On the base-dependence of sets of numbers recognizable by finite automata
• On Ordered Groups