Existence of constants in regular splicing languages (Q2346417)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Existence of constants in regular splicing languages |
scientific article |
Statements
Existence of constants in regular splicing languages (English)
0 references
1 June 2015
0 references
It is proved that every language \(L\) generated by a finite splicing system of \textit{G. Păun} [Discrete Appl. Math. 70, No. 1, 57--79 (1996; Zbl 0855.68051)] contains a word with a factor \(w\) such that for all words \(u\), \(v\), \(\bar{u}\) and \(\bar{v}\), if both \(uwv\) and \(\bar{u}w\bar{v}\) belong to \(L\), then \(uw\bar{v}\) belongs to \(L\) as well.
0 references
splicing system
0 references
synchronizing word of a partial finite automaton
0 references
0 references
0 references
0 references
