Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes

DOI10.1016/0304-3975(94)90285-2zbMath0824.68065OpenAlexW1992389382WikidataQ127937948 ScholiaQ127937948MaRDI QIDQ1341748

Norman R. Reilly

Publication date: 9 January 1995

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90285-2

zbMATH Keywords

syntactic monoidlocal orthogroups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Formal languages and automata (68Q45)

Related Items (2)

Complete endomorphisms of the lattice of pseudovarieties of finite semigroups ⋮ Completely regular semigroups as semigroups of partial transformations

Cites Work

• The Rhodes expansion and free objects in varieties of completely regular semigroups
• Iteration of expansions. Unambiguous semigroups
• On varieties of completely regular semigroups. I
• Unions of groups of small height
• Varieties of orthodox bands of groups
• Cyclotomic polynomials and unions of groups
• Completely regular semigroups as semigroups of partial transformations
• Semigroups admitting relative inverses
• Team tournaments and finite elementary codes
• Codes asynchrones
• The free completely regular semigroup on a set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes