6533b86cfe1ef96bd12c8bf1
RESEARCH PRODUCT
Star-free trace languages
Antonio RestivoGiovanna GuaianaSergio Salemisubject
MonoidPure mathematicsGeneral Computer ScienceAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Star (graph theory)Cone (formal languages)Theoretical Computer ScienceTrace (semiology)Aperiodic graphFormal languageComputer Science::Programming LanguagesCommutative propertyMathematicsComputer Science(all)description
Abstract Generalizing a classical result of Schutzenberger to free partially commutative monoids, we prove that the family of star-free trace languages coincides with the family of aperiodic trace languages.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1992-04-01 | Theoretical Computer Science |