Abstract
Motivated by the general problem to characterize families of languages closed under shuffle, we investigate some conditions under which the shuffle of two star-free languages is star-free. Some of the special cases here approached give rise to new problems in combinatorics on words.
Lingua originale | English |
---|---|
pagine (da-a) | 35-44 |
Numero di pagine | 10 |
Rivista | Fundamenta Informaticae |
Volume | 116 |
Stato di pubblicazione | Published - 2012 |
All Science Journal Classification (ASJC) codes
- ???subjectarea.asjc.2600.2614???
- ???subjectarea.asjc.2600.2602???
- ???subjectarea.asjc.1700.1710???
- ???subjectarea.asjc.1700.1703???