Cancellativity in finitely presented semigroups
DOI10.1016/S0747-7171(89)80028-8zbMath0682.20046OpenAlexW4210679658MaRDI QIDQ1824041
Paliath Narendran, Colm P. O'Dunlaing
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80028-8
finitely presented semigroupsChurch-Rosser Thue systemscancellativityundecidablecommutative Thue systemssemigroups presented by Thue systems
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decidable sentences of Church-Rosser congruences
- Complexity of certain decision problems about congruential languages
- Thue systems as rewriting systems
- New decision algorithms for finitely presented commutative semigroups
- Testing for the Church-Rosser property
- Undecidable questions related to Church-Rosser Thue systems
- The Knuth-Bendix Completion Procedure and Thue Systems
- Confluent and Other Types of Thue Systems
- Elementary properties of Abelian groups
This page was built for publication: Cancellativity in finitely presented semigroups