Regular semigroups with D=R as syntactic monoids of prefix codes
From MaRDI portal
Publication:1146016
DOI10.1016/0304-3975(76)90063-3zbMath0446.68075OpenAlexW2080006424MaRDI QIDQ1146016
Publication date: 1977
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90063-3
Formal languages and automata (68Q45) Artificial intelligence (68T99) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (3)
On varieties of rational languages and variable length codes. II ⋮ The structure of finite monoids satisfying the relation \(\mathcal R=\mathcal H\). ⋮ Cyclotomic polynomials and unions of groups
Cites Work
This page was built for publication: Regular semigroups with D=R as syntactic monoids of prefix codes