EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 25 / No 3 (1991) RAIRO-Theor. Inf. Appl., 25 3 (1991) 205-218 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 25, Number 3, 1991
Page(s) 205 - 218
DOI https://doi.org/10.1051/ita/1991250302051
Published online 01 February 2017
  1. 1. A. ARNOLD and M. DAUCHET, Théorie des magmoïdes, RAIRO Inform. Théor. Appl., 1978, 12, 3, pp. 235-257. [EuDML: 92079] [MR: 510640] [Zbl: 0391.68037] [Google Scholar]
  2. 2. A. ARNOLD and M. DAUCHET, Théorie des magmoïdes, RAIRO Inform. Théor. Appl., 1979, 13, 2, pp. 135-154. [EuDML: 92094] [MR: 543937] [Zbl: 0443.68053] [Google Scholar]
  3. 3. F. BOSSUT and B. WARIN, Rationalité and reconnaissabilité dans des graphes acycliques, Ph. D., University of Lille-I, 1986. [Google Scholar]
  4. 4. F. BOSSUT and B. WARIN, Problème de décision sur les dags, publication interne IT 107 du L.I.F.L., Université de Lille-I, Villeneuve-d'Ascq, France, 1987. [Google Scholar]
  5. 5. M. DAUCHET, It is undecidable whether a finite set of trees is a code, publication interne IT 109 du L.I.F.L., Université de Lille-I, Villeneuve-d'Ascq, France, 1987. [Google Scholar]
  6. 6. J. E. HOPCROFT and J. D. ULLMAN, Formal languages and their relation to automata, Addison Wesley, series in computer science an information processing, 1969. [MR: 237243] [Zbl: 0196.01701] [Google Scholar]
  7. 7. G. HOTZ, Eine Algegraisierung des Syntheseproblems von Schaltkreisen, 1965, EIK l, pp. 185-205, 209-231. [Zbl: 0156.25504] [Google Scholar]
  8. 8. T. KAMIMURA and G. SLUTZKI, Parallel and Two-Way Automata on Directed Ordered Acyclic Graphs, Inform. and Control, 1981, 49, pp. 10-51. [MR: 642475] [Zbl: 0482.68051] [Google Scholar]
  9. 9. LOECK, The Parsing for General Phrase-Structure Grammars, Inform. and Control, 1970, 16. pp. 443-464. [MR: 272567] [Zbl: 0207.01601] [Google Scholar]
  10. 10. M. NIVAT, Code d'arbres, presented to Journées Hispano-Françaises d'Informatique Théorique et Programmation coordonnées avec LANFOR 86, Barcelone, nov. 1986. [Google Scholar]
  11. 11. M. NIVAT, Tree codes, Tapsoft 87, Pise, 1987. [Zbl: 0798.68083] [Google Scholar]
  12. 12. C. W. PATTERSON and A. A. SARDINAS, A Necessary and sufficient condition for the unique decomposition of coded messages, IRE intern. conv. Record, 1953, 8, pp. 104-108. [Google Scholar]
  13. 13. C. P. SCHNORR, Transformational classes of grammar, Inform. and Control, 1969, 14, pp. 252-277. [MR: 249228] [Zbl: 0184.28502] [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.