On the syntactic transformation semigroup of a language generated by a finite biprefix code
From MaRDI portal
Publication:1165022
DOI10.1016/0304-3975(89)90085-6zbMath0486.68078MaRDI QIDQ1165022
Publication date: 1982
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(89)90085-6
68Q45: Formal languages and automata
20M35: Semigroups in automata theory, linguistics, etc.
94A45: Prefix, length-variable, comma-free codes
Related Items
Inverse semigroups and varieties of finite semigroups, Biprefix codes, inverse semigroups and syntactic monoids of injective automata, On varieties of rational languages and variable length codes. II, A hierarchy of shift equivalent sofic shifts
Cites Work
- Unnamed Item
- On varieties of rational languages and variable length codes. II
- Une topologie du monoide libre
- Sur mon article Une topologie du monoide libre
- On varieties of rational languages and variable-length codes
- On the complexity of finite semigroups
- Sur le produit de concatenation non ambigu
- Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
- On certain codes admitting inverse semigroups as syntactic monoids