Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1995: Automata, Languages and Programming pp 348–359Cite as

Polynomial closure and unambiguous product

  • Automata and Formal Languages II
  • Conference paper
  • First Online:

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

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.

References

  1. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific (Series in Algebra, Volume 3), Singapore, 1995, 511 pp.

    Google Scholar 

  2. M. Arfi, Polynomial operations and rational languages, 4th STACS, Lecture Notes in Computer Science 247, (1987) 198–206.

    Google Scholar 

  3. M. Arfi, Opérations polynomials et hiérarchies de concaténation, Theoret. Comput. Sci. 91, (1991) 71–84.

    Google Scholar 

  4. F. Blanchet-Sadri, On dot-depth two, Informatique Théorique et Applications 24, (1990) 521–529.

    Google Scholar 

  5. F. Blanchet-Sadri, On a complete set of generators for dot-depth two, Discrete Appl. Math., 50, (1994) 1–25.

    Google Scholar 

  6. S. L. Bloom, Varieties of ordered algebras, J. Comput. System Sci. 13, (1976) 200–212.

    Google Scholar 

  7. J. A, Brzozowski, Hierarchies of aperiodic languages, RAIRO Inform. Théor. 10, (1976) 33–49.

    Google Scholar 

  8. D. Cowan, Inverse monoids of dot-depth 2, Int. Jour. Alg. and Comp. 3, (1993) 411–424.

    Google Scholar 

  9. S. Eilenberg, Automata, languages and machines, Vol. B, Academic Press, New York, 1976.

    Google Scholar 

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

    Google Scholar 

  11. R. Knast, Some theorems on graph congruences, RAIRO Inform. Théor. 17, (1983) 331–342.

    Google Scholar 

  12. S. W. Margolis and J.E. Pin, Product of group languages, FCT Conference, Lecture Notes in Computer Science 199, (1985) 285–299.

    Google Scholar 

  13. R. McNaughton and S. Pappert, Counter-free Automata, MIT Press, 1971.

    Google Scholar 

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

    Google Scholar 

  15. J.-E. Pin, Propriétés syntactiques du produit non ambigu. 7th ICALP, Lecture Notes in Computer Science 85, (1980) 483–499.

    Google Scholar 

  16. J.-E. Pin, Variétés de langages formels, Masson, Paris, 1984. English translation: Varieties of formal languages, Plenum, New-York, 1986.

    Google Scholar 

  17. J.-E. Pin, Logic, Semigroups and Automata on Words, Annals of Math. and Artificial Intelligence, to appear.

    Google Scholar 

  18. J.-E. Pin, A variety theorem without complementation, Izvestija vuzov. Matematika, to appear.

    Google Scholar 

  19. J.-E. Pin and H. Straubing, Monoids of upper triangular matrices, Colloquia Math. Soc. Janos Bolyai 39, Semigroups, Szeged, (1981) 259–272.

    Google Scholar 

  20. J.-E. Pin, H. Straubing and D. Thérien, Locally trivial categories and unambiguous concatenation, Journal of Pure and Applied Algebra 52, (1988) 297–311.

    Google Scholar 

  21. J.-E. Pin and P. Weil, Free profinite semigroups, Mal'cev products and identities, to appear.

    Google Scholar 

  22. J.-E. Pin and P. Weil, A Reiterman theorem for pseudovarieties of finite first-order structures, to appear.

    Google Scholar 

  23. J. Reiterman, The Birkhoff theorem for finite algebras, Algebra Universalis 14, (1982) 1–10.

    Google Scholar 

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

    Google Scholar 

  25. M.P. Schützenberger, Sur le produit de concaténation non ambigu, Semi-group Forum 13, (1976) 47–75.

    Google Scholar 

  26. I. Simon, Piecewise testable events, Proc. 2nd GI Conf., Lecture Notes in Computer Science 33, (1975) 214–222.

    Google Scholar 

  27. I. Simon, Factorization forests of finite height, Theoret. Comput. Sci. 72, (1990) 65–94.

    Google Scholar 

  28. I. Simon, The product of rational languages, Proceedings of ICALP 1993, Lecture Notes in Computer Science 700, (1993), 430–444.

    Google Scholar 

  29. J. Stern, Characterization of some classes of regular events, Theoret. Comput. Sci. 35, (1985) 17–42.

    Google Scholar 

  30. H. Straubing, Aperiodic homomorphisms and the concatenation product of recognizable sets, J. Pure Appl. Algebra 15 (1979) 319–327.

    Google Scholar 

  31. H. Straubing, Semigroups and languages of dot-depth two, Theoret. Comput. Sci. 58 (1988) 361–378.

    Google Scholar 

  32. H. Straubing and D. Thérien, Partially ordered finite monoids and a theorem of I. Simon, J. of Algebra 119, (1985) 393–399.

    Google Scholar 

  33. H. Straubing and P. Weil, On a conjecture concerning dot-depth two languages, Theoret. Comput. Sci. 104, (1992) 161–183.

    Google Scholar 

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

    Google Scholar 

  35. P. Weil, Inverse monoids of dot-depth two, Theoret. Comput. Sci. 66, (1989), 233–245.

    Google Scholar 

  36. P. Weil, Some results on the dot-depth hierarchy, Semigroup Forum 46 (1993), 352–370.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP/IBP, Université Paris VI et CNRS, Tour 55-65, 4 Place Jussieu, 75252, Paris Cedex 05, France

    Pascal Weil

Authors
  1. Jean-Eric Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pascal Weil
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Fülöp Ferenc Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pin, JE., Weil, P. (1995). Polynomial closure and unambiguous product. In: Fülöp, Z., Gécseg, F. (eds) Automata, Languages and Programming. ICALP 1995. Lecture Notes in Computer Science, vol 944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60084-1_87

Download citation

  • DOI: https://doi.org/10.1007/3-540-60084-1_87

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60084-8

  • Online ISBN: 978-3-540-49425-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation