On a special monoid with a single defining relation

DOI10.1016/0304-3975(81)90031-1MaRDI QIDQ1162607zbMATH OpenOpenAlexFDO

Authors Matthias Jantzen

Publication date 1981

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(81)90031-1

zbMATH Keywords

confluent congruencecontext-free languagefree monoidpreperfect congruence

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Mappings of semigroups (20M15) Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Cites work

• Confluent and Other Types of Thue Systems
• Eine neue Invariante für kontextfreie Sprachen
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)

Cited in

(21)

• A note on a special one-rule semi-Thue system
• Rational strong codes and structure of rational group languages
• Monoids with disjunctive identity and their codes
• Thue systems as rewriting systems
• A note on regular classes in special Thue systems
• An efficient algorithm to decide whether a monoid presented by a regular Church-Rosser Thue system is a group
• On the descriptive power of special Thue systems
• A note on representations of a certain monoid
• Monadic Thue systems
• When is a monoid a group? The Church-Rosser case is tractable
• It is undecidable whether a finite special string-rewriting system presents a group
• Relating rewriting techniques on monoids and rings: congruences on monoids and ideals in monoid rings
• Infinite regular Thue systems
• The word problem for one-relation monoids: a survey
• On the word problem for special monoids
• A note on special thue systems with a single defining relation
• Finite complete rewriting systems for the Jantzen monoid and the Greendlinger group
• Remarks on an example of Jantzen
• Homogeneous Thue systems and the Church-Rosser property
• Sur les monoides à un relateur qui sont des groupes
• About the descriptive power of certain classes of finite string-rewriting systems

This page was built for publication: On a special monoid with a single defining relation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162607)