Abstract
We prove an effective characterization of level 5/2 of the Straubing-Thérien hierarchy for the restricted case of languages defined over a two-letter alphabet.
Supported by the Studienstiftung des Deutschen Volkes.
Partially supported by the Deutsche Forschungsgemeinschaft, grantWa 847/4-1.
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
M. Arfi. Polynomial operations on rational languages. In Proceedings 4th Symposium on Theoretical Aspects of Computer Science, volume 247 of Lecture Notes in Computer Science, pages 198–206. Springer-Verlag, 1987.
M. Arfi. Opérations polynomiales et hiérarchies de concaténation. Theoretical Computer Science, 91:71–84, 1991.
J. A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences, 16:37–55, 1978.
R. S. Cohen and J. A. Brzozowski. Dot-depth of star-free events. Journal of Computer and System Sciences, 5:1–16, 1971.
C. Glaßer and H. Schmitz. Languages of dot-depth 3/2. In Proceedings 17th Symposium on Theoretical Aspects of Computer Science, volume 1770 of Lecture Notes in Computer Science, pages 555–566. Springer Verlag, 2000.
C. Glaßer and H. Schmitz. Decidable hierarchies of starfree languages. In Proceedings 20th Conference on the Foundations of Software Technology and Theoretical Computer Science, volume 1974 of Lecture Notes in Computer Science, pages 503–515. Springer Verlag, 2000.
R. Knast. A semigroup characterization of dot-depth one languages. RAIRO Inform. Théor., 17:321–330, 1983.
R. McNaughton and S. Papert. Counterfree Automata. MIT Press, Cambridge, 1971.
D. Perrin and J. E. Pin. First-order logic and star-free sets. Journal of Computer and System Sciences, 32:393–406, 1986.
J. E. Pin. Syntactic semigroups. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, volume I, pages 679–746. Springer, 1996.
J. E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of computing systems, 30:383–422, 1997.
H. Schmitz. The Forbidden-Pattern Approach to Concatenation Hierarchies. PhD thesis, Fakultät für Mathematik und Informatik, UniversitätWürzburg, 2001.
M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190–194, 1965.
I. Simon. Piecewise testable events. In Proceedings 2nd GI Conference, volume 33 of Lecture Notes in Computer Science, pages 214–222. Springer-Verlag, 1975.
H. Straubing. A generalization of the Schützenberger product of finite monoids. Theoretical Computer Science, 13:137–150, 1981.
H. Straubing. Finite semigroups varieties of the formV * D. J. Pure Appl. Algebra, 36:53–94, 1985.
H. Straubing. Semigroups and languages of dot-depth two. Theoretical Computer Science, 58:361–378, 1988.
D. Thérien. Classification of finite monoids: the language approach. Theoretical Computer Science, 14:195–208, 1981.
W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25:360–376, 1982.
W. Thomas. Languages, automata, and logic. Technical Report 9607, Institut für Informatik und praktische Mathematik, Universität Kiel, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Glaßer, C., Schmitz, H. (2002). Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_21
Download citation
DOI: https://doi.org/10.1007/3-540-46011-X_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43453-5
Online ISBN: 978-3-540-46011-4
eBook Packages: Springer Book Archive