Skip to main content
SpringerLink
Log in
Book cover

LITP Spring School on Theoretical Computer Science

LITP 1988: Formal Properties of Finite Automata and Applications pp 1–14Cite as

Finite automata and rational languages an introduction

  • Mathematical Foundations Of The Theory Of Automata
  • Conference paper
  • First Online:

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

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. A. Aho, J. Hopcroft, J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. V. Amar, G. Putzolu, Generalizations of regular events, Inform. Contr.8 (1965), 56–63.

    Article  Google Scholar 

  3. J. M. Autebert, Languages algébriques, Masson, 1987.

    Google Scholar 

  4. G. Berry, R. Sethi, From regular expressions to deterministic automata, Theoret. Comput. Sci.48 (1986), 117–126.

    Article  Google Scholar 

  5. J. Brzozowski, Derivatives of regular expressions, J. Assoc. Comput. Mach.11 (1964), 481–494.

    Google Scholar 

  6. J. Conway, Regular Algebra and Finite Machines, Chapman and Hall, 1971.

    Google Scholar 

  7. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, 1974.

    Google Scholar 

  8. S. Eilenberg, M. P. Schützenberger, Rational sets in commutative monoids, J. Algebra13 (1969), 173–191.

    Article  Google Scholar 

  9. S. C. Kleene, Representation of events in nerve nets and finite automata, in: C. Shannon, J. McCarthy (eds), Automata Studies, Princeton University Press, 1956, 3–41.

    Google Scholar 

  10. R. McNaugthon, H. Yamada, Regular expressions and state graphs for automata, IRE Trans. on Electronic ComputersEC-9:1, 1960, 39–47.

    Google Scholar 

  11. C. Mead, L. Conway, Introduction to VLSI Systems, Addison-Wesley, 1980.

    Google Scholar 

  12. E. F. Moore, Gedanken experiments on sequential machines, in: C. Shannon, J. McCarthy (eds), Automata Studies, Princeton Univ. Press, 1956, 129–153.

    Google Scholar 

  13. D. Perrin, Finite automata, Handbook of Theoretical Computer Science, North-Holland, (in press).

    Google Scholar 

  14. D. Perrin, J. Sakarovitch, Automates finis, Journées scientifiques et prix UAP, Edition scientifiques de l'UAP, vol. 1, Paris, 1988.

    Google Scholar 

  15. M. Pelletier, J. Sakarovitch, Easy multiplications II. Extensions of rational semigroups, Techn. Report 88-63, LITP, Paris.

    Google Scholar 

  16. M. O. Rabin, D. Scott, Finite automata and their decision problem, IBM J. Res. Devel.3, 1959, 114–125.

    Google Scholar 

  17. J. Sakarovitch, Easy multiplications I. The realm of Kleene's theorem, Inf. Comput.74, 1987, 173–197.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LITP Université Pierre et Marie Curie, Paris, France

    Jean Berstel

Authors
  1. Jean Berstel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J. (1989). Finite automata and rational languages an introduction. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013107

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51631-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation