Skip to main content
SpringerLink
Log in

Some recent results on recognizable formal power series

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

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

Included in the following conference series:

  • 325 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. B. Benzaghou, Algèbres de Hadamard, Bull. Soc. Math. France 98 (1970), p. 209–252.

    Google Scholar 

  2. P.J. Cahen, J.L. Chabert, Elements quasi-entiers et extensions de Fatou, J. of Algebra 36 (1975) p 185–192.

    Google Scholar 

  3. L. Chottin, Une démonstration combinatoire de la formule de Lagrange à deux variables, Discrete Mathematics 13 (1975), p. 215–224.

    Google Scholar 

  4. R. Cori, Un code pour les graphes planaires et ses applications, Astérisque 27 (1975).

    Google Scholar 

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

    Google Scholar 

  6. M. Fliess, Sur certaines familles de séries formelles, Thèse, Universités Paris 7, 1972.

    Google Scholar 

  7. M. Fliess, Matrices de Hankel, J. Maths Pures et Appliquées 53 (1974), p 197–222.

    Google Scholar 

  8. M. Fliess, Propriétés booléennes des langages stochastiques, Math. Systems Theory 7 (1974), p 353–359.

    Google Scholar 

  9. M. Fliess, Un outil algébrique: les séries formelles non commutatives, in: G. Marchesini, S. K. Mitter (eds), Mathematical System Theory, Lecture Notes in Economics and Mathematical Systems Vol. 131, Springer 1976, p 122–148.

    Google Scholar 

  10. M. Fliess, Un calcul symbolique non commutatif pour les asservissements non linéaires et non stationnaires, in: J. Cea (ed.), Optimization Techniques, Lecture Notes in Computer Science Vol 41, Springer 1976, p. 496–509.

    Google Scholar 

  11. G. Jacob, Représentations et substitutions matricielles dans la théorie algébrique des transductions, Thèse, Université Paris 7, 1975.

    Google Scholar 

  12. G. Jacob, Décidabilité de la finitude des demigroupes de matrices, in: Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science Vol. 48, Springer 1977, p 259–269.

    Google Scholar 

  13. G. Jacob, Un théorème de factorisation des produits d'endomorphismes de KN, J. of Algebra, to appear.

    Google Scholar 

  14. G. Jacob, Un algorithme calculant le cardinal des demi-groupes de matrices sur un corps commutatif, Theoretical Computer Science, to appear.

    Google Scholar 

  15. M. Nivat, Tranductions des langages de Chomsky, Annales de l'Institut Fourier 18 (1968), 339–456.

    Google Scholar 

  16. J.-F. Perrot, Informatique et algèbre: la théorie des codes à longueur variable, in: Theoretical Computer Science, 3rd GI Conference, Lecture Notes in Computer Science Vol. 48, Springer 1977, p 27–44.

    Google Scholar 

  17. G. Polya, G. Szegö, Aufgaben und Lehrsätze ans der Analysis, Vol. 2, Springer 1925.

    Google Scholar 

  18. Ch. Reutenauer, Une caractérisation de la finitude de l'ensemble des coefficients d'une série rationnelle en variables non commutatives, C. R. Acad. Sci. Paris, 284 (1977), Série A, to appear.

    Google Scholar 

  19. Ch. Reutenauer, Thèse 3ème cycle, in preparation.

    Google Scholar 

  20. A. Salomaa, Formal power series, to appear.

    Google Scholar 

  21. M. P. Schützenberger, On the definition of a family of automata, Information and Control 4 (1961), p 245–270.

    Google Scholar 

  22. M. P. Schützenberger, Finite counting automata, Information and Control 5 (1962), p 91–107.

    Google Scholar 

  23. M. P. Schützenberger, On a theorem of R. Jungen, Proc. American Math. Soc. 13 (1962), p 885–890.

    Google Scholar 

  24. M. P. Schützenberger, A remark on acceptable sets of numbers, J. Assoc. Comp. Mach. 15 (1968), p 300–303.

    Google Scholar 

  25. M. P. Schützenberger, Sur les relations rationnelles fonctionnelles entre monoïdes libres, Theoretical Computer Science, to appear.

    Google Scholar 

  26. E. Sontag, On some questions of rationality and decidability, J. of Computer and System Sciences, 11 (1975), p 375–381.

    Google Scholar 

  27. P. Turakainen, Generalized automata and stochastic languages, Proc. American Math. Soc. 21 (1969), p 303–309.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut de Programmation and Laboratoire associé Informatique Théorique et Programmation, Université Pierre et Marie Curie, Paris, France

    J. Berstel

Authors
  1. J. Berstel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berstel, J. (1977). Some recent results on recognizable formal power series. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_68

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_68

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation