On the Shuffle of Star-Free Languages

Authors:
Giusi Castiglione;Antonio Restivo
Affiliations:
(Correspd.) Dipartimento di Matematica e Informatica, Universitá di Palermo, Via Archirafi 34, 90123 Palermo, Italy, giusi@math.unipa.it;Dipartimento di Matematica e Informatica, Universitá di Palermo, Via Archirafi 34, 90123 Palermo, Italy, restivo@math.unipa.it
Venue:
Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju
Year:
2012

Citing 9
Cited 0

Process algebra

Process algebra
Finite automata

Handbook of theoretical computer science (vol. B)
Syntactic semigroups

Handbook of formal languages, vol. 1
Automata, Languages, and Machines

Automata, Languages, and Machines
Varieties Of Formal Languages

Varieties Of Formal Languages
Codes and aperiodic languages

1. Fachtagung über Automatentheorie und Formale Sprachen
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
A note on pure codes

Acta Informatica
The expressive power of the shuffle product

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.