An automata theoretic approach to the generalized word problem in graphs of groups

DOI10.1090/S0002-9939-09-10126-0zbMath1235.20033arXiv0905.4395MaRDI QIDQ5189169

Markus Lohrey, Benjamin Steinberg

Publication date: 8 March 2010

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

automata theoryfinitely generated groupsgeneralized word problemgraphs of groups

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of some extended word problems defined by cancellation rules
• On the rational subset problem for groups.
• The submonoid and rational subset membership problems for graph groups.
• Intersections of finitely generated subgroups of free groups and resolutions of graphs
• Occurrence problem for free solvable groups
• Subgroups of small Cancellation Groups
• A RESIDUALLY FINITE VERSION OF RIPS'S CONSTRUCTION
• FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM

This page was built for publication: An automata theoretic approach to the generalized word problem in graphs of groups