Skip to main content
SpringerLink
Log in

The characteristic polynomial of a finite automaton

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1976 (MFCS 1976)

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

Abstract

We study certain decompositions of a finite automaton in relationship with the factorisations of a polynomial associated to it.

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. ČERNÝ J. — On directable automata, Kybernetica, 7 (1971) 289–298

    Google Scholar 

  2. CLIFFORD A.H. and G.B. PRESTON — The Algebraic Theory of Semigroups, Vol. 1, Amer. Math. Soc. (1961)

    Google Scholar 

  3. EILENBERG S. — Automata, Languages and Machines, Vol. A, Academic Press (1974)

    Google Scholar 

  4. FELLER W. — An Introduction to Probability Theory and its Applications, Vol. 1, Wiley Publ. in Statistics (1957)

    Google Scholar 

  5. GANTMACHER F-R. — Théorie des Matrices (translated from Russian) Paris, Dunod (1966)

    Google Scholar 

  6. KROHN K.K., J.L. RHODES and R. TILSON — The prime decomposition theorem of the algebraic theory of machines, in Algebraic Theory of Machines, Languages and Semigrops (M.A. Arbib ed.) Academic Press (1968) 81–125

    Google Scholar 

  7. PERLES M., RABIN M.O. and E. SHAMIR — The theory of definite automata, IEEE Trans. on E.C., 12 (1963) 233–243

    Google Scholar 

  8. PERRIN D. — Codes Conjugués, Information and Control, 20, 3 (1972) 222–231

    Article  Google Scholar 

  9. PERRIN D. — Sur certains semigroupes syntaxiques, in Logique et Automates, Seminaires IRIA (1971) 169–177

    Google Scholar 

  10. PERRIN D. — Codes Bipréfixes et Groupes de Permutations, Thèse, Paris (1975)

    Google Scholar 

  11. PERROT J-F. — Une Théorie Algébrique des Automates finis monogènes, Symposia Mathematica, XV (1975) 201–244

    Google Scholar 

  12. SCHUTZENBERGER M.P. — On a special class of recurrent events, Annals of Math. Stat., 32 (1961) 1201–1213

    Google Scholar 

  13. SCHUTZENBERGER M.P. — Sur certains sous-monoïdes libres, Bull. Soc. Math. de France, 93 (1965) 209–223

    Google Scholar 

  14. WIELANDT H. — Finite Permutation Groups, Academic Press (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement de Mathématiques, Université Paris VII, T. 45-55, 2, place Jussieu, 75221, Paris Cedex 05

    D. Perrin

Authors
  1. D. Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Antoni Mazurkiewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1976 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrin, D. (1976). The characteristic polynomial of a finite automaton. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_214

Download citation

  • DOI: https://doi.org/10.1007/3-540-07854-1_214

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38169-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation