scientific article
From MaRDI portal
Publication:3341886
zbMath0549.68025MaRDI QIDQ3341886
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmfree groupword problemfinitely presented grouprational subsetsfinitely generated groupregular setmonadic group
Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (10)
Computing presentations for subgroups of polycyclic groups and of context-free groups ⋮ On the decidability of semigroup freeness ⋮ Thue systems as rewriting systems ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Commutativity in groups presented by finite Church-Rosser Thue systems ⋮ Gilman's conjecture ⋮ Deciding if the angle is zero inside free groups ⋮ Groups and NTS languages ⋮ Rewriting systems, plain groups, and geodetic graphs
This page was built for publication:
