Skip to main content
SpringerLink
Log in

On non-counting regular classes

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1990)

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

Included in the following conference series:

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. Brzozowski, K. Culik II and A. Gabrielian, Classification of non-counting events, J. Comput. Syst. Sci. 5(1971)41–53.

    Google Scholar 

  2. J. Brzozowski, Open problems about regular languages, in R.V. Book, ed., Formal Language Theory, Perspectives and Open Problems, Academic Press, London, New York, 1980.

    Google Scholar 

  3. A. de Luca and S. Varricchio, A finiteness condition for semigroups generalizing a theorem of Hotzel, J. of Algebra, to appear.

    Google Scholar 

  4. A. Ehrenfeucht and G. Rozenberg, On regularity of languages generated by copying systems, Discrete Applied Mathematics 8(1984)313–317.

    Google Scholar 

  5. S. Eilenberg, "Automata, Languages and Machines", Academic Press, vol A, 1974, vol B, 1976

    Google Scholar 

  6. N.J. Fine and M.S. Wilf, Uniqueness theorem for periodic functions, Proc. Amer; Math. Soc. 16(1965) 109–114.

    Google Scholar 

  7. J.A. Green and D. Rees, On semigroups in which xr=x, Proc. Cambridge Philos. Soc., 48 (1952)35–40.

    Google Scholar 

  8. E. Hotzel, On finiteness conditions in semigroups, Journal of Algebra, 60(1979)352–370.

    Google Scholar 

  9. G. Lallement, "Semigroups and Combinatorial Applications", J. Wiley & Sons, New York, 1979

    Google Scholar 

  10. M. Lothaire, "Combinatorics on words", Addison Wesley, Reading, Mass. 1983

    Google Scholar 

  11. R. McNaughton and S. Papert, "Counter-free Automata", The M.I.T. Press, Cambridge, Mass. 1971.

    Google Scholar 

  12. I. Simon, Notes on Noncounting Languages of order 2, April 1970, manuscript.

    Google Scholar 

  13. A. Thue, Uber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen, Videnskabsselskabets Skrifter, 1, Mat.-Nat. K.1., Christiania, 1912

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Matematica, Università di Roma "La Sapienza", Italy

    Aldo de Luca

  2. Dip. di Matematica Pura e Applicata, Università dell'Aquila, Italy

    Stefano Varricchio

Authors
  1. Aldo de Luca
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Varricchio
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., Varricchio, S. (1990). On non-counting regular classes. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032023

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation