Conditional semi-Thue systems for presenting monoids

DOI10.1007/3-540-55210-3_212zbMath1494.68108OpenAlexW2095875500MaRDI QIDQ5096810

Thomas Deiß

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

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Thue and Post systems, etc. (03D03)

Related Items (1)

Equational Theorem Proving for Clauses over Strings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Conditional semi-Thue systems for presenting monoids