Finite Automata Presentable Abelian Groups
From MaRDI portal
Publication:5434523
DOI10.1007/978-3-540-72734-7_29zbMath1133.68050OpenAlexW2108099664MaRDI QIDQ5434523
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
Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Torsion-free groups, finite rank (20K15)
Related Items
FA-presentable groups and rings ⋮ Algebraic structures computable without delay ⋮ Eliminating unbounded search in computable algebra ⋮ The back-and-forth method and computability without delay ⋮ BREAKING UP FINITE AUTOMATA PRESENTABLE TORSION-FREE ABELIAN GROUPS
This page was built for publication: Finite Automata Presentable Abelian Groups
