A star operation for star-free trace languages

Authors:
Edward Ochmański;Krystyna Stawikowska
Affiliations:
Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Torun and Institute of Computer Science, Polish Academy of Sciences, Warszawa, Poland;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Torun
Venue:
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Year:
2007

Citing 10
Cited 2

Finite automata

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

Theoretical Computer Science
Logical definability on infinite traces

ICALP Selected papers of the twentieth international colloquium on Automata, languages and programming
A note on the commutative closure of star-free languages

Information Processing Letters
Partial commutation and traces

Handbook of formal languages, vol. 3
Handbook of Formal Languages

Handbook of Formal Languages
The Book of Traces

The Book of Traces
Languages and Logical Definability in Concurrency Monoids

CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Counter-Free Automata (M.I.T. research monograph no. 65)

Counter-Free Automata (M.I.T. research monograph no. 65)
Star-free Star and Trace Languages

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005

When Does Partial Commutative Closure Preserve Regularity?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Regular languages and partial commutations

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

The paper deals with star-free languages in trace monoids. We define a constrained star operation, named star-free star, and show a new characterisation of star-free trace languages, using this operation instead of complement. We obtain this characterisation combining a star-free star characterisation for word languages and logical characterisation of trace languages (Ebinger/Muscholl). Moreover, some new, simple proofs of known results are presented in the paper.