A characterization of rational star languages generated by strong codes (Q1092172): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q3853827 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the Burnside problem for semigroups / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rational languages and the Burnside problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4170649 / rank | |||
Normal rank | |||
Revision as of 10:55, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A characterization of rational star languages generated by strong codes |
scientific article |
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
