Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1983: Automata, Languages and Programming pp 617–628Cite as

Arbres et hierarchies de concatenation

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. J.A. Brzozowski, Hierarchies of aperiodic languages, RAIRO, Informatique Théorique, vol. 10, 1976, 33–49.

    Google Scholar 

  2. J.A. Brzozowski et R. Knast, The dot-depth hierarchy of star-free languages is infinite, J. Computer and System Sciences, vol. 16, 1976, 37–55.

    Google Scholar 

  3. J.A. Brzozowski et I. Simon, Characterizations of locally testable events Discrete Mathematics, vol. 4, 1973, 243–271.

    Google Scholar 

  4. S. Eilenberg, Automata, languages and machines, vol. B, Academic Press, New York (1976)

    Google Scholar 

  5. R. Knast, Some theorems on graph congruences. A paraÎtre dans la RAIRO, Informatique Théorique.

    Google Scholar 

  6. R. Knast, A semigroup characterization of dop-depth one languages. A paraÎtre dans la RAIRO, Informatique Théorique.

    Google Scholar 

  7. G. Lallement, Semigroups and Combinatorial applications, Wiley, New-York, 1979.

    Google Scholar 

  8. J.E. Pin, Variétés de langages et variétés de semigroupes. Thèse, Paris, 1961.

    Google Scholar 

  9. J.E. Pin et J. Sakarovitch, Une application de la représentation matricielle des transductions. A paraÎtre.

    Google Scholar 

  10. J.E. Pin et H. Straubing, Monoids of upper-triangular matrices, à paraÎtre.

    Google Scholar 

  11. C. Reutenauer, Sur les variétés de langages et de monoÏdes, Lect. Notes in Computer Science nℴ 67, Springer Verlag, Berlin [1979] 260–265.

    Google Scholar 

  12. I. Simon, Hierarchies of events with dop-depth one, These, Université de Waterloo (1972).

    Google Scholar 

  13. I. Simon, Piecewise testable events, Lect. Notes in Computer Science nℴ 33, Springer Verlag, Berlin (1975), 214–222.

    Google Scholar 

  14. H. Straubing, A generalization of the Schützenberger product of finite monoids, Theor. Comp. Sc. 13 (1981), 137–150.

    Google Scholar 

  15. H. Straubing, A study of the dot-depth hierarchy (à paraÎtre).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique Théorique et de Programmation, Université Paris VI et CNRS, Tour 55–65, 4 Place Jussieu, 7523D, Paris Cedex 05, France

    Jean -Eric Pin

Authors
  1. Jean -Eric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pin, J.E. (1983). Arbres et hierarchies de concatenation. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036942

Download citation

  • DOI: https://doi.org/10.1007/BFb0036942

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation