Free Access
| Issue |
RAIRO. Inform. théor.
Volume 12, Number 4, 1978
|
|
|---|---|---|
| Page(s) | 319 - 337 | |
| DOI | https://doi.org/10.1051/ita/1978120403191 | |
| Published online | 01 February 2017 | |
- 1. B. COURCELLE, A Representation of Trees by Languages, Theoretical Computer Science Vol. 7, 1978, pp. 25-55. [MR: 495226] [Zbl: 0428.68088] [Google Scholar]
- 2. B. COURCELLE and M. NIVAT, Algebraic Families of Interpretations, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 137-146. [MR: 451817] [Google Scholar]
- 3. S. HEILBRUNNER, Gleichungssysteme für Zeichenreihen, Technische Universität München, Bericht Nr. 7311, 1973. [Google Scholar]
- 4. D. LEHMANN, Categories for Fixpoint Semantics, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 122-126. [MR: 474955] [Google Scholar]
- 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 311-327. [MR: 213241] [Zbl: 0212.33902] [Google Scholar]
- 6. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, this journal, Vol. 11, 1977, pp. 311-327. [EuDML: 92059] [MR: 468353] [Zbl: 0371.68025] [Google Scholar]
- 7. M. NIVAT, Éléments de la théorie générale des Codes, in Automata Theory, E. R. CAIANIELLO, ed., Academic Press 1966, pp. 278-294. [MR: 241168] [Zbl: 0208.45101] [Google Scholar]
- 8. J. W. THATCHER, Generalized Sequential Machines Maps, J. Comput. System Sci., Vol. 4, 1970, pp. 339-367. [MR: 302335] [Zbl: 0198.03303] [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.