Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
type: Item
instance of: scholarly article
title: Bounds on the variety generated by completely regular syntactic monoids from finite prefix codes
zbMATH Open document ID: 0824.68065
DOI: 10.1016/0304-3975(94)90285-2
author: Norman R. Reilly
published in: Theoretical Computer Science
publication date: 1995-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 708727
zbMATH Keywords: syntactic monoid
zbMATH Keywords: local orthogroups
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90285-2
OpenAlex ID: W1992389382
cites work: Iteration of expansions. Unambiguous semigroups
cites work: Semigroups admitting relative inverses
cites work: The free completely regular semigroup on a set
cites work: Q4132170
cites work: Q4126563
cites work: Q3754190
cites work: Q4347967
cites work: Cyclotomic polynomials and unions of groups
cites work: Q3853827
cites work: Unions of groups of small height
cites work: Team tournaments and finite elementary codes
cites work: Q3487647
cites work: Codes asynchrones
cites work: Varieties of orthodox bands of groups
cites work: Q4724825
cites work: Q4484922
cites work: On varieties of completely regular semigroups. I
cites work: Q5784065
cites work: Q3689372
cites work: The Rhodes expansion and free objects in varieties of completely regular semigroups
cites work: Completely regular semigroups as semigroups of partial transformations
cites work: Q4001349
Wikidata QID: Q127937948
description: scientific article; zbMATH DE number 708727