Monoids with disjunctive identity and their codes

DOI10.1007/BF01953967zbMath0623.20052OpenAlexW2019907441MaRDI QIDQ1091482

H. J. Shyr, Helmut Jürgensen, Gabriel Thierrin

Publication date: 1986

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01953967

zbMATH Keywords

presentationsmonoidscongruencefinitely generated monoiddisjunctive identityDyck languagesinfinite strong codesstrong code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General structure theory for semigroups (20M10) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Syntactic monoids in the construction of systolic tree automata, Insertion and deletion closure of languages, Subapical bracketed L-systems, Monogenic \(e\)-closed languages and dipolar words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semigroups with each element disjunctive
• A note on representations of a certain monoid
• On a special monoid with a single defining relation
• Une généralisation des ensembles de Dyck
• A remark concerning congruences on [0-bisimple inverse semigroups]
• Ordered catenation and regular free disjunctive languages
• Hypercodes, Right Convex Languages and their Syntactic Monoids
• Confluent and Other Types of Thue Systems