Some theorems on graph congruences
Knast, Robert
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983), p. 331-342 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1983-01-01
@article{ITA_1983__17_4_331_0,
     author = {Knast, Robert},
     title = {Some theorems on graph congruences},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {17},
     year = {1983},
     pages = {331-342},
     mrnumber = {743893},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1983__17_4_331_0}
}

Knast, Robert. Some theorems on graph congruences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 17 (1983) pp. 331-342. http://gdmltest.u-ga.fr/item/ITA_1983__17_4_331_0/

1. J. A. Brzozowski and I. Simon, Characterization of Locally Testable Events, Discrete Math., Vol. 4 1973, pp. 243-271. | MR 319404 | Zbl 0255.94032

2. 10. Eilenberg, Automata, Languages and Machines, Vol. B, 1976, Academic Press. | Zbl 0359.94067

3. R. Knast, A Semigroup Characterization of Dot-Depth One Languages R.A.I.R.O., Informatique théorique, Vol. 17, No. 4, 1983, pp. 321-330. | Numdam | MR 743892 | Zbl 0522.68063

4. I. Simon, Piecewise Testable Events {2nd GI-Professional Conference on Automata Theory and Formal Languages, L.N. in Computer Science, Vol. 33, 1975, Springer Verlag, pp. 214-222). | MR 427498 | Zbl 0316.68034