1992 | ReviewPaper | Buchkapitel
Conditional semi-Thue systems for presenting monoids
verfasst von : Thomas Deiß
Erschienen in: STACS 92
Verlag: Springer Berlin Heidelberg
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
There are well known examples of monoids in literature which do not admit a finite and canonical presentation by a semi-Thue system over a fixed alphabet, not even over an arbitrary alphabet. We introduce conditional Thue and semi-Thue systems similar to conditional term rewriting systems as defined by Kaplan. Using these conditional semi-Thue systems we give finite and canonical presentations of the examples mentioned above. Furthermore we show, that every finitely generated monoid with decidable word problem is embeddable in a monoid which has a finite canonical conditional presentation.