scientific article; zbMATH DE number 3876579

MaRDI QIDQ3341886zbMATH OpenFDO

Authors Robert H. Gilman

Publication date 1984

zbMATH Keywords

algorithmfinitely generated groupfinitely presented groupfree groupmonadic grouprational subsetsregular setword problem

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Formal languages and automata (68Q45) Symbolic computation and algebraic computation (68W30)

Recommendations

• On the rational subset problem for groups.
• Rational subsets of groups
• The rational subset membership problem for groups: a survey
• Submonoids and rational subsets of groups with infinitely many ends.
• On the rational subsets of the free group

Cited in

(14)

• Thue systems as rewriting systems
• Complexity, combinatorial group theory and the language of palutators
• Computing presentations for subgroups of polycyclic groups and of context-free groups
• Gilman's conjecture
• Rewriting systems, plain groups, and geodetic graphs
• Rational subsets of groups
• On the decidability of semigroup freeness.
• scientific article; zbMATH DE number 4010764 (Why is no real title available?)
• Commutativity in groups presented by finite Church-Rosser Thue systems
• scientific article; zbMATH DE number 4003555 (Why is no real title available?)
• Groups and NTS languages
• Deciding if the angle is zero inside free groups
• Membership problems in infinite groups
• About the descriptive power of certain classes of finite string-rewriting systems

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3341886)