Formal language theory and the geometry of 3-manifolds

DOI10.1007/BF02566435zbMath0873.20026OpenAlexW2059867050MaRDI QIDQ1354823

Robert H. Gilman, Martin R. Bridson

Publication date: 3 September 1997

Published in: Commentarii Mathematici Helvetici (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/140412

zbMATH Keywords

finitely generated groupsCayley graphsformal languagesbounded languagescontext-free languagesregular languages3-orbifoldscombingsindexed languagesThurston geometrization conjectureasynchronously automatic groupsasynchronous fellow traveller propertyfundamental groups of compact 3-manifoldsnormal forms for 3-manifold groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Nilpotent groups (20F18) Topological methods in group theory (57M07) General geometric structures on low-dimensional manifolds (57M50) Semigroups in automata theory, linguistics, etc. (20M35) Fundamental group, presentations, free differential calculus (57M05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34)

Related Items

The Development of the Theory of Automatic Groups ⋮ A NOTE ON THE GRAMMAR OF COMBINGS ⋮ Lamplighter groups and automata ⋮ Ideals of equations for elements in a free group and context-free languages ⋮ MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS ⋮ \(\mathcal C\)-graph automatic groups. ⋮ Algorithms and topology of Cayley graphs for groups. ⋮ Geometry of the word problem for 3-manifold groups ⋮ Applications of L systems to group theory ⋮ The growth function of context-free languages ⋮ From automatic structures to automatic groups. ⋮ Secondary cup and cap products in coarse geometry ⋮ Commensurating HNN extensions: nonpositive curvature and biautomaticity ⋮ Cayley polynomial-time computable groups ⋮ An example of an automatic graph of intermediate growth ⋮ COMBING NILPOTENT AND POLYCYCLIC GROUPS ⋮ Context-free languages of sub-exponential growth