Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
From MaRDI portal
Publication:3741791
DOI10.2307/2000531zbMath0604.20034OpenAlexW4241409250MaRDI QIDQ3741791
Friedrich Otto, Jürgen Avenhaus, Klaus Madlener
Publication date: 1986
Full work available at URL: https://doi.org/10.2307/2000531
Generators, relations, and presentations of groups (20F05) 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)
Related Items (10)
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 ⋮ On groups presented by inverse-closed finite confluent length-reducing rewriting systems ⋮ Commutativity in groups presented by finite Church-Rosser Thue systems ⋮ Gilman's conjecture ⋮ Elements of Finite Order for Finite Monadic Church-Rosser Thue Systems ⋮ Groups and NTS languages ⋮ On stallings' unique factorisation groups ⋮ Rewriting systems, plain groups, and geodetic graphs
Cites Work
- Recursive unsolvability of group theoretic problems
- Groups, the theory of ends, and context-free languages
- Monadic Thue systems
- When is a monoid a group? The Church-Rosser case is tractable
- Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
- Groups and Simple Languages
- The uniform conjugacy problem for finite church—Rosser thue systems is NP-complete
- Confluent and Other Types of Thue Systems
- Hierarchies of Computable groups and the word problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Groups Presented by Finite Two-Monadic Church-Rosser Thue Systems
