Biprefix codes, inverse semigroups and syntactic monoids of injective automata
From MaRDI portal
Publication:1060022
DOI10.1016/0304-3975(84)90031-8zbMath0567.68047OpenAlexW2003635352WikidataQ114214850 ScholiaQ114214850MaRDI QIDQ1060022
Publication date: 1984
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(84)90031-8
Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)
Related Items (7)
OPTIMIZATION OF MULTIPLE CLASSIFIERS IN DATA MINING BASED ON STRING REWRITING SYSTEMS ⋮ A Lower Bound For Reversible Automata ⋮ Optimization of classifiers for data mining based on combinatorial semigroups ⋮ Inverse semigroups and varieties of finite semigroups ⋮ A formula for multiple classifiers in data mining based on Brandt semigroups ⋮ On locally reversible languages ⋮ REES MATRIX CONSTRUCTIONS FOR CLUSTERING OF DATA
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur mon article Une topologie du monoide libre
- On varieties of rational languages and variable-length codes
- On the syntactic transformation semigroup of a language generated by a finite biprefix code
- Sur le monoide syntactique de \(L^*\)lorsque L est un langage fini
- Addendum to `Representations of inverse semigroups by one-to-one partial transformations of a set'
- On certain codes admitting inverse semigroups as syntactic monoids
- Semigroups satisfying minimal conditions II
This page was built for publication: Biprefix codes, inverse semigroups and syntactic monoids of injective automata