Skip to main content
SpringerLink
Log in

A concatenation game and the dot-depth hierarchy

  • Chapter
  • First Online:
Computation Theory and Logic

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

Abstract

We introduce a variant of the Ehrenfeucht Fraïssé game which is appropriate for an analysis of the expressive power of star-free regular expressions. As an application we present a simple proof showing that the dot-depth hierarchy of star-free languages is strict.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Barrington DA, Thérien D (1986) Finite monoids and the fine structure of NC, draft.

    Google Scholar 

  • Brzozowski JA, Knast R (1978) The dot-depth hierarchy of star-free languages is infinite, J Comput System Sci 16, 37–55.

    Google Scholar 

  • Cohen RS, Brzozowski JA (1971) Dot-Depth of Star-free events, J Comput System Sci 5, 1–16.

    Google Scholar 

  • McNaughton R, Papert S (1971) Counter-Free Automata, MIT-Press.

    Google Scholar 

  • Pin JE (1984) Hierarchies de concatenation, RAIRO Inform Théor 18, 23–46.

    Google Scholar 

  • Perrin D, Pin JE (1986) First-order logic and star-free sets, J Comput System Sci 32, 393–406.

    Google Scholar 

  • Sistla AP, Clarke EM, Francez N, Meyer AR (1984) Can message buffers be axiomatized in linear temporal logic? Inform Contr 63, 88–112.

    Google Scholar 

  • Straubing H (1981) A generalization of the Schützenberger product of finite monoids, Theor Comput Sci 13, 107–110.

    Google Scholar 

  • Thomas W (1982) Classifying regular events in symbolic logic, J Comput System Sci 25, 360–376.

    Google Scholar 

  • Thomas W (1984) An application of the Ehrenfeucht Fraïssé game in formal language theory, Bull Soc Math France, Mem 16, 11–21.

    Google Scholar 

  • Thomas W, Lippert D (1986) Relativized star-free expressions, first-order logic, and a concatenation game, Schriften zur angew. Math. u. Informatik Nr. 121, RWTH Aachen.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lenrstuhl für Informatik II, Büchel 29-31, D-5100, Aachen

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Thomas, W. (1987). A concatenation game and the dot-depth hierarchy. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_183

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_183

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation