On z-submonoids and z-codes
Madonia, M. ; Salemi, S. ; Sportelli, T.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991), p. 305-322 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1991__25_4_305_0,
     author = {Madonia, M. and Salemi, S. and Sportelli, T.},
     title = {On $z$-submonoids and $z$-codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {25},
     year = {1991},
     pages = {305-322},
     mrnumber = {1134385},
     zbl = {0764.68089},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1991__25_4_305_0}
}

Madonia, M.; Salemi, S.; Sportelli, T. On $z$-submonoids and $z$-codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 25 (1991) pp. 305-322. http://gdmltest.u-ga.fr/item/ITA_1991__25_4_305_0/

1. M. Anselmo, Automates et codes zigzag, R.A.l.R.O. Inform. Théor. Appl., 1991, 25, 1, pp. 49-66. | Numdam | MR 1104411 | Zbl 0735.68050

2. J. Berstel and D. Perrin, Theory of codes, Academic Press, 1985. | MR 797069 | Zbl 0587.68066

3. J. C. Birget, Two-way automaton computations, R.A.I.R.O. Inform. Thèor. Appl., 1990, 24, 1, pp. 47-66. | Numdam | MR 1060466 | Zbl 0701.68058

4. J. P. Pécuchet, Automates boustrophédons, langages reconnaissables de mots infinis et variétés de semi-groupes, Thèse d'État, L.I.T.P., mai 1986.

5. J. P. Pécuchet, Automates boustrophédons, semi-groupe de Birget et monoïde inversif libre, R.A.I.R.O. Inform. Thèor. Appl., 1985, 19, 1, pp. 71-100. | Numdam | MR 795773 | Zbl 0604.68094