1. 1. BERSTEL J., Some Recent Results on Recognizable Formal Power Series in Fundamentals of Computation Theory, KARPINSKI, éd., Lecture Notes in Computer Science, n° 56, Springer, 1977, p. 39-48.4837370365.68061
2. 2. BOASSON L., COURCELLE B. et NIVAT M., A New Complexity Measure for Languages in Conference on Theoretical Computer Sciences, Waterloo, Canada, 1977.4951820431.68077
3. 3. CHOFFRUT C., Thèse de Doctorat d'État, en préparation.
4. 4. EILENBERG S., Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.5303820317.94045
5. 5. FLIESS M., Matrices de Hanlsel, J. Math. Pures appl., vol. 53, 1974, p, 197-222.3643280315.94051