Conditional semi-Thue systems for presenting monoids
From MaRDI portal
Publication:5096810
DOI10.1007/3-540-55210-3_212zbMath1494.68108MaRDI QIDQ5096810
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:hbz:386-kluedo-3073
20M35: Semigroups in automata theory, linguistics, etc.
68Q42: Grammars and rewriting systems
03D03: Thue and Post systems, etc.
Related Items
Cites Work
- Verifying nilpotence
- Conditional rewrite rules
- A finite Thue system with decidable word problem and without equivalent finite canonical system
- Simplifying conditional term rewriting systems: Unification, termination and confluence
- Word problems and a homological finiteness condition for monoids
- A Noetherian and confluent rewrite system for idempotent semigroups
- A finiteness condition for rewriting systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Divergence phenomena during completion
- Computability of Recursive Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item