Automatic Quotients of Free Groups

2003/05/04 by Robert H. Gilman, Gilman, Robert H.
Computer Science · Mathematics · #Geometric and Algebraic Topology #Natural Language Processing Techniques #math.GR #msc:20F65 #msc:68Q45 #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.math/0305065

14 pages, no figures. Minor corrections. Statements of theorems and lemmas are unchanged

arxiv created 2005/03/20 · arxiv updated 2009/11/30

Abstract

Automatic groups admitting prefix closed automatic structures with uniqueness are characterized as the quotients of free groups by normal subgroups possessing sets of free generators satisfying certain language-theoretic conditions.

Related

• On groups whose word problem is solved by a nested stack automaton
• Anagrammatic quotients of free groups
• Word automatic groups of nilpotency class 2
• Polynomial-time word problems
• Rational subsets of groups