Finite Automata Presentable Abelian Groups

DOI10.1007/978-3-540-72734-7_29MaRDI QIDQ5434523zbMATH OpenOpenAlexFDO

Authors André Nies, Pavel Semukhin

Publication date 4 January 2008

Published in Logical Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72734-7_29

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Torsion-free groups, finite rank (20K15) Algebraic theory of languages and automata (68Q70)

Recommendations

• Finite automata presentable Abelian groups
• Breaking up finite automata presentable torsion-free Abelian groups.
• scientific article; zbMATH DE number 1972789
• FA-presentable groups and rings
• Describing Groups

Cited in

(10)

• Eliminating unbounded search in computable algebra
• The back-and-forth method and computability without delay
• String compression in FA-presentable structures
• The additive group of the rationals does not have an automatic presentation
• Breaking up finite automata presentable torsion-free Abelian groups.
• Describing Groups
• Algebraic structures computable without delay
• Finite automata presentable Abelian groups
• Word structures and their automatic presentations
• FA-presentable groups and rings

This page was built for publication: Finite Automata Presentable Abelian Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5434523)