A characterization of rational star languages generated by strong codes (Q1092172)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A characterization of rational star languages generated by strong codes |
scientific article; zbMATH DE number 4012905
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of rational star languages generated by strong codes |
scientific article; zbMATH DE number 4012905 |
Statements
A characterization of rational star languages generated by strong codes (English)
0 references
1987
0 references
It is shown here that for a strong code C the free monoid \(C^*\) is rational if and only if it is periodic and possesses the permutation property of \textit{A. Restivo} and \textit{C. Reutenauer} [Theor. Comput. Sci. 40, 13-30 (1985; Zbl 0597.68057)]. A code C is strong by definition if for all words u, w, v such that uwv is in \(C^*\) then \(uv\in C^*\) just in case \(w\in C^*\).
0 references
strong code
0 references
free monoid
0 references
permutation property
0 references
words
0 references
0.8897435
0 references
0 references
0.83963156
0 references
0.8386609
0 references
0.8357852
0 references
0.82876396
0 references
0 references
