Star-free trace languages

Generalizing a classical result of Schützenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 97; no. 2; pp. 301 - 311
Main Authors Guaiana, Giovanna, Restivo, Antonio, Salemi, Sergio
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 27.04.1992
Elsevier
Subjects
Applied sciences
Automata. Abstract machines. Turing machines
Computer science; control theory; systems
Exact sciences and technology
Theoretical computing
Commutativity
Formal language
Trace
System behaviour
Computer theory
Theorem proving
Concurrency
Finite automaton
Monoid
Computer system
Online AccessGet full text

Cover

More Information
Summary:Generalizing a classical result of Schützenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
ISSN:0304-3975
1879-2294
DOI:10.1016/0304-3975(92)90080-Y