A note on a special one-rule semi-Thue system
From MaRDI portal
Publication:1067781
DOI10.1016/0020-0190(85)90018-3zbMath0581.68030OpenAlexW2048613608MaRDI QIDQ1067781
Publication date: 1985
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(85)90018-3
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)
Related Items
n-level rewriting systems ⋮ Commutative monoids have complete presentations by free (non-commutative) monoids ⋮ Complete semi-Thue systems for abelian groups ⋮ Finite derivation type for Rees matrix semigroups ⋮ Restrictions of congruences generated by finite canonical string-rewriting systems ⋮ On deciding the confluence of a finite string-rewriting system on a given congruence class ⋮ Word problems and a homological finiteness condition for monoids ⋮ Pseudo-natural algorithms for finitely generated presentations of monoids and groups ⋮ Church-Rooser property and homology of monoids ⋮ Finite canonical rewriting systems for congruences generated by concurrency relations ⋮ About the descriptive power of certain classes of finite string-rewriting systems ⋮ Decision problems for finite special string-rewriting systems that are confluent on some congruence class ⋮ The word problem for one-relation monoids: a survey ⋮ Convergent presentations and polygraphic resolutions of associative algebras ⋮ Using string-rewriting for solving the word problem for finitely presented groups ⋮ Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings ⋮ On prefixal one-rule string rewrite systems ⋮ Polygraphs of finite derivation type ⋮ Rewriting systems of Coxeter groups
Cites Work
- Unnamed Item
- Unnamed Item
- Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
- Finite complete rewriting systems and the complexity of word problem
- Groups, the theory of ends, and context-free languages
- Remarks on an example of Jantzen
- A note on representations of a certain monoid
- On a special monoid with a single defining relation
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
