On a code problem concerning planar acyclic graphs
Bossut, F. ; Warin, B.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991), p. 205-218 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1991-01-01
@article{ITA_1991__25_3_205_0,
     author = {Bossut, F. and Warin, B.},
     title = {On a code problem concerning planar acyclic graphs},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {25},
     year = {1991},
     pages = {205-218},
     mrnumber = {1119041},
     zbl = {0727.68053},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1991__25_3_205_0}
}

Bossut, F.; Warin, B. On a code problem concerning planar acyclic graphs. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) pp. 205-218. http://gdmltest.u-ga.fr/item/ITA_1991__25_3_205_0/

1. A. Arnold and M. Dauchet, Théorie des magmoïdes, RAIRO Inform. Théor. Appl., 1978, 12, 3, pp. 235-257. | Numdam | MR 510640 | Zbl 0391.68037

2. A. Arnold and M. Dauchet, Théorie des magmoïdes, RAIRO Inform. Théor. Appl., 1979, 13, 2, pp. 135-154. | Numdam | MR 543937 | Zbl 0443.68053

3. F. Bossut and B. Warin, Rationalité and reconnaissabilité dans des graphes acycliques, Ph. D., University of Lille-I, 1986.

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.

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.

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

7. G. Hotz, Eine Algegraisierung des Syntheseproblems von Schaltkreisen, 1965, EIK l, pp. 185-205, 209-231. | MR 204202 | Zbl 0156.25504

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

9. Loeck, The Parsing for General Phrase-Structure Grammars, Inform. and Control, 1970, 16. pp. 443-464. | MR 272567 | Zbl 0207.01601

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.

11. M. Nivat, Tree codes, Tapsoft 87, Pise, 1987.

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.

13. C. P. Schnorr, Transformational classes of grammar, Inform. and Control, 1969, 14, pp. 252-277. | MR 249228 | Zbl 0184.28502