Star-free Star and Trace Languages

Authors:
Edward Ochmań/ski;Krystyna Stawikowska
Affiliations:
Faculty of Mathematics and Computer Science Nicolaus Copernicus University, Toruń/, Poland. E-mails: edoch@mat.uni.torun.pl/ entropia@mat.uni.torun.pl;Faculty of Mathematics and Computer Science Nicolaus Copernicus University, Toruń/, Poland. E-mails: edoch@mat.uni.torun.pl/ entropia@mat.uni.torun.pl
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 3
Cited 2

Finite automata

Handbook of theoretical computer science (vol. B)
Star-free trace languages

Theoretical Computer Science
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

When Does Partial Commutative Closure Preserve Regularity?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
A star operation for star-free trace languages

DLT'07 Proceedings of the 11th international conference on Developments in language theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with star-free languages in free monoids and trace monoids. We introduce the notion of star-free star, fundamental for this paper, and show that the classes of star-free languages and star-free star languages coincide. Then, using this result, we obtain a general characterization of star-free trace languages, containing a result of Guaiana/Restivo/Salemi (star-free=aperiodic in trace monoids), originally proved in a more involved, combinatorial way.