This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Références
S. Eilenberg: Automata languages and machines vol. A; Acad. Press (1974)
S. Ginsburg et E.H. Spanier: Bounded algol-like languages; Trans. Amer. Math. Soc. 113 (1964) 333–368.
J. Karhumäki: Remarks on commutative N — rational series; Theor. Comput. Sci.
W. Ogden: Intercalation theorems for pushdown store and stack languages; Ph. D. Thesis Stanford (1968).
J.-F. Perrot et J. Sakarovitch: Langages algébriques déterministes et groupes abéliens; Automata Theory and Formal Languages 2nd GI conference Lecture Notes in Comput. Sci. 33 20–30.
K. Ruohonen: On the Synthesis of DOL Growth; Ann. Acad. Sc. Fenn. Ser. Ser. A.I.; 1 (1975) 143–154.
A. Salomaa et M. Soittola: Automata theoretic aspects of formal power series; Springer Verlag.
M.P. Schützenberger: On the definition of a family of automata; Information and Control 4 (1961) 245–270.
M.P. Schützenberger: Certain elementary families of automata; Proc. of the symposium on mathematical theory of automata (1962) 139–153.
M.P. Schützenberger: Finite counting automata; Information and Control 5 (1962) 91–107.
M. Soria: Thèse 3ème cycle; Université Pierre et Marie Curie, Paris (à paraitre).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Reutenauer, C. (1978). Sur les series rationnelles en variables non commutatives. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive