Skip to main content
Springer Nature Link
Log in

New results on the generalized star-height problem

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

  • 158 Accesses

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

  1. J. A. Brzozowski, Open problems about regular languages, Formal language theory, perspectives and open problems (R.V. Book editor), Academic Press, New York, 1980, 23–47.

    Google Scholar 

  2. S. Eilenberg, Automata, Languages and Machines, Academic Press, New York, Vol. A, 1974; Vol B, 1976.

    Google Scholar 

  3. W.H. Henneman, Algebraic theory of automata, Ph. D. Dissertation, MIT (1971).

    Google Scholar 

  4. G. Lallement, Semigroups and Combinatorial Applications, Wiley, New York, 1979.

    Google Scholar 

  5. M. Lothaire, Combinatorics on words, Encyclopedia of Mathematics 17, Addison-Wesley, Reading, MA, 1983.

    Google Scholar 

  6. R. McNaughton and S. Papert, Counter-free Automata, MIT-Press, Cambridge, Mass., 1971.

    Google Scholar 

  7. J.E. Pin, Varieties of formal languages, North Oxford Academic, London and Plenum, New York, 1986.

    Google Scholar 

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

    Google Scholar 

  9. J. Stern, Complexity of some problems from the theory of automata, Information and Control 66 (1985), 163–176.

    Google Scholar 

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

    Google Scholar 

  11. D. Thérien, Classification of regular languages by congruences, Ph. D. Thesis, Waterloo, 1980.

    Google Scholar 

  12. D. Thérien, Subwords counting and nilpotent groups, in Combinatorics on Words, Progress and Perspectives, L. Cummings ed., Academic Press (1983), 293–306.

    Google Scholar 

  13. W. Thomas, Remark on the Star-Height Problem, Theoretical Computer Science 13, 1981, 231–237.

    Google Scholar 

Download references

Authors
  1. J. E. Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Straubing
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Thérien
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pin, J.E., Straubing, H., Thérien, D. (1989). New results on the generalized star-height problem. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029007

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics