Skip to main content
SpringerLink
Log in

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2295))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. M. Arfi. Opérations polynomiales et hiérarchies de concaténation. Theoretical Computer Science, 91:71–84, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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.

    Article  MATH  MathSciNet  Google Scholar 

  4. R. S. Cohen and J. A. Brzozowski. Dot-depth of star-free events. Journal of Computer and System Sciences, 5:1–16, 1971.

    MATH  MathSciNet  Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Google Scholar 

  7. R. Knast. A semigroup characterization of dot-depth one languages. RAIRO Inform. Théor., 17:321–330, 1983.

    MATH  MathSciNet  Google Scholar 

  8. R. McNaughton and S. Papert. Counterfree Automata. MIT Press, Cambridge, 1971.

    Google Scholar 

  9. D. Perrin and J. E. Pin. First-order logic and star-free sets. Journal of Computer and System Sciences, 32:393–406, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. E. Pin. Syntactic semigroups. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, volume I, pages 679–746. Springer, 1996.

    Google Scholar 

  11. J. E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of computing systems, 30:383–422, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  12. H. Schmitz. The Forbidden-Pattern Approach to Concatenation Hierarchies. PhD thesis, Fakultät für Mathematik und Informatik, UniversitätWürzburg, 2001.

    Google Scholar 

  13. M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190–194, 1965.

    Article  MATH  MathSciNet  Google Scholar 

  14. I. Simon. Piecewise testable events. In Proceedings 2nd GI Conference, volume 33 of Lecture Notes in Computer Science, pages 214–222. Springer-Verlag, 1975.

    Google Scholar 

  15. H. Straubing. A generalization of the Schützenberger product of finite monoids. Theoretical Computer Science, 13:137–150, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  16. H. Straubing. Finite semigroups varieties of the formV * D. J. Pure Appl. Algebra, 36:53–94, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  17. H. Straubing. Semigroups and languages of dot-depth two. Theoretical Computer Science, 58:361–378, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  18. D. Thérien. Classification of finite monoids: the language approach. Theoretical Computer Science, 14:195–208, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  19. W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25:360–376, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  20. W. Thomas. Languages, automata, and logic. Technical Report 9607, Institut für Informatik und praktische Mathematik, Universität Kiel, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Theoretische Informatik, UniversitätWürzburg, 97074, Am Hubland, Würzburg, Germany

    Christian Glaßer

  2. sd&m AG, software design & management, Thomas-Dehler-Str. 27, 81737, München, Germany

    Heinz Schmitz

Authors
  1. Christian Glaßer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heinz Schmitz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation