scientific article; zbMATH DE number 848082

zbMath0851.20030arXivmath/9509204MaRDI QIDQ4867134

Robert H. Gilman

Publication date: 27 November 1996

Full work available at URL: https://arxiv.org/abs/math/9509204

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

relationsautomatageneratorsword problemformal languagescontext-free languagesgrammarsautomatic groupsrational languagesstack automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (27)

Word problems of groups: formal languages, characterizations and decidability ⋮ On rationality of verbal subsets in a group ⋮ EXTENDED FINITE AUTOMATA AND WORD PROBLEMS ⋮ On the word problem for special monoids ⋮ On groups whose word problem is solved by a counter automaton. ⋮ On the rational subset problem for groups. ⋮ Superpositions of free Fox derivations ⋮ Submonoids and rational subsets of groups with infinitely many ends. ⋮ Undecidability of the submonoid membership problem for free nilpotent group of class $l\geqslant 2$ of sufficiently large rank ⋮ POLYCYCLIC, METABELIAN OR SOLUBLE OF TYPE (FP)_∞ GROUPS WITH BOOLEAN ALGEBRA OF RATIONAL SETS AND BIAUTOMATIC SOLUBLE GROUPS ARE VIRTUALLY ABELIAN ⋮ Tilings and submonoids of metabelian groups. ⋮ Unnamed Item ⋮ The complexity of verbal languages over groups ⋮ Context-sensitive languages and G-automata ⋮ Polycyclic and Bicyclic Valence Automata ⋮ The submonoid and rational subset membership problems for graph groups. ⋮ Solvability of equations in classes of solvable groups and Lie algebras ⋮ A context-free and a 1-counter geodesic language for a Baumslag-Solitar group ⋮ From automatic structures to automatic groups. ⋮ Two problems for solvable and nilpotent groups ⋮ Word problems recognisable by deterministic blind monoid automata ⋮ Cone types and geodesic languages for lamplighter groups and Thompson's group \(F\). ⋮ Rationality of verbal subsets in solvable groups ⋮ Groups whose word problems are not semilinear ⋮ Closedness of a class of groups under free product ⋮ Rational subsets and submonoids of wreath products. ⋮ Growth and ergodicity of context-free languages

This page was built for publication: