On the Shuffle of Star-Free Languages

Giuseppa Castiglione; Antonio Restivo

On the Shuffle of Star-Free Languages

Giuseppa Castiglione, Antonio Restivo

Matematica e Informatica

Risultato della ricerca: Article › peer 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 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???

Altri file e collegamenti

OA Link

Cita questo

@article{98cee4fcdde84707b7f698fea811c7fd,

title = "On the Shuffle of Star-Free Languages",

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.",

keywords = "Regular languages, combinatorics on words., pure submonoids, shuffle of languages, star-free languages, Regular languages, combinatorics on words., pure submonoids, shuffle of languages, star-free languages",

author = "Giuseppa Castiglione and Antonio Restivo",

year = "2012",

language = "English",

volume = "116",

pages = "35--44",

journal = "Fundamenta Informaticae",

issn = "0169-2968",

publisher = "IOS Press",

}

TY - JOUR

T1 - On the Shuffle of Star-Free Languages

AU - Castiglione, Giuseppa

AU - Restivo, Antonio

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Regular languages

KW - combinatorics on words.

KW - pure submonoids

KW - shuffle of languages

KW - star-free languages

KW - Regular languages

KW - combinatorics on words.

KW - pure submonoids

KW - shuffle of languages

KW - star-free languages

UR - http://hdl.handle.net/10447/64503

M3 - Article

VL - 116

SP - 35

EP - 44

JO - Fundamenta Informaticae

JF - Fundamenta Informaticae

SN - 0169-2968

ER -

On the Shuffle of Star-Free Languages

Abstract

All Science Journal Classification (ASJC) codes

Altri file e collegamenti

Fingerprint

Cita questo