Geodesic
Complexity of boundary graph languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 3, pp. 267-274 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{ITA_1990__24_3_267_0,
     author = {Engelfriet, Joost and Leih, George},
     title = {Complexity of boundary graph languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {267--274},
     year = {1990},
     publisher = {EDP-Sciences},
     volume = {24},
     number = {3},
     mrnumber = {1072994},
     zbl = {0701.68062},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ITA_1990__24_3_267_0/}
}
TY  - JOUR
AU  - Engelfriet, Joost
AU  - Leih, George
TI  - Complexity of boundary graph languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1990
SP  - 267
EP  - 274
VL  - 24
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/ITA_1990__24_3_267_0/
LA  - en
ID  - ITA_1990__24_3_267_0
ER  - 
%0 Journal Article
%A Engelfriet, Joost
%A Leih, George
%T Complexity of boundary graph languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1990
%P 267-274
%V 24
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/ITA_1990__24_3_267_0/
%G en
%F ITA_1990__24_3_267_0
Engelfriet, Joost; Leih, George. Complexity of boundary graph languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 24 (1990) no. 3, pp. 267-274. http://geodesic.mathdoc.fr/item/ITA_1990__24_3_267_0/