On the Shuffle of Star-Free Languages

Risultato della ricerca: Articlepeer review

3 Citazioni (Scopus)

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 originaleEnglish
pagine (da-a)35-44
Numero di pagine10
RivistaFundamenta Informaticae
Volume116
Stato di pubblicazionePublished - 2012

All Science Journal Classification (ASJC) codes

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.2600.2602???
  • ???subjectarea.asjc.1700.1710???
  • ???subjectarea.asjc.1700.1703???

Fingerprint

Entra nei temi di ricerca di 'On the Shuffle of Star-Free Languages'. Insieme formano una fingerprint unica.

Cita questo