Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Bounded Synchronization Delay in Omega-Rational Expressions
verfasst von : Volker Diekert, Manfred Kufleitner
Erschienen in: Computer Science – Theory and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In 1965 Schützenberger published his famous result that star-free languages (SF) and aperiodic languages (AP) coincide over finite words, often written as SF = AP. Perrin generalized SF = AP to infinite words in the mid 1980s. In 1973 Schützenberger presented another (and less known) characterization of aperiodic languages in terms of rational expressions where the use of the star operation is restricted to prefix codes with bounded synchronization delay and no complementation is used. We denote this class of languages by SD. In this paper, we present a generalization of SD = AP to infinite words. This became possible via a substantial simplification of the proof for the corresponding result for finite words. Moreover, we show that SD = AP can be viewed as more fundamental than SF = AP in the sense that the classical 1965 result of Schützenberger and its 1980s extension to infinite words by Perrin are immediate consequences of SD = AP.