Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A.: A syntactic congruence for rational ω-languages. Theoretical Computer Science 39, 333–335 (1985)
Diekert, V., Gastin, P.: Pure future local temporal logics are expressively complete for Mazurkiewicz traces. Information and Computation 204, 1597–1619 (2006); Conference version in LATIN 2004. LNCS, vol. 2976, pp. 170–182 (2004)
Diekert, V., Gastin, P.: First-order definable languages. In: Logic and Automata: History and Perspectives. Texts in Logic and Games, pp. 261–306. Amsterdam University Press (2008)
Diekert, V., Kufleitner, M., Steinberg, B.: The Krohn-Rhodes Theorem and local divisors. arXiv, abs/1111.1585 (2011)
Golomb, S.W., Gordon, B.: Codes with bounded synchronization delay. Information and Control 8(4), 355–372 (1965)
Kamp, J.A.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Los Angeles, California (1968)
McNaughton, R., Papert, S.: Counter-Free Automata. The MIT Press (1971)
Meyberg, K.: Lectures on algebras and triple systems. Technical report, University of Virginia, Charlottesville (1972)
Perrin, D.: Recent Results on Automata and Infinite Words. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 134–148. Springer, Heidelberg (1984)
Perrin, D., Pin, J.-É.: Infinite words. Pure and Applied Mathematics, vol. 141. Elsevier, Amsterdam (2004)
Pin, J.-É.: Varieties of Formal Languages. North Oxford Academic, London (1986)
Schützenberger, M.P.: On finite monoids having only trivial subgroups. Inf. Control 8, 190–194 (1965)
Schützenberger, M.P.: Sur certaines opérations de fermeture dans les langages rationnels. In: Symposia Mathematica, Convegno di Informatica Teorica, INDAM, Roma, 1973, vol. XV, pp. 245–253. Academic Press, London (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diekert, V., Kufleitner, M. (2012). Bounded Synchronization Delay in Omega-Rational Expressions. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-30642-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30641-9
Online ISBN: 978-3-642-30642-6
eBook Packages: Computer ScienceComputer Science (R0)