Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre
Pécuchet, J. P.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985), p. 71-100 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1985__19_1_71_0,
     author = {P\'ecuchet, J. P.},
     title = {Automates boustrophedon, semi-groupe de Birget et mono\"\i de inversif libre},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {19},
     year = {1985},
     pages = {71-100},
     mrnumber = {795773},
     zbl = {0604.68094},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1985__19_1_71_0}
}

Pécuchet, J. P. Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) pp. 71-100. http://gdmltest.u-ga.fr/item/ITA_1985__19_1_71_0/

1. Aho, Hopcroft et Hullman, Time and Tape Complexity of Pushdown Automaton Languages, Information and Control, vol. 13, n° 3, 1968, p. 186-206. | Zbl 0257.68065

2. Berstel, Transductions and Context-Free Languages, Teubner, 1979. | MR 549481 | Zbl 0424.68040

3. Birget, Ph. D, Un. of California, Berkeley, 1983.

4. Eilenberg, Automata, Languages and Machines, Vol. A, Acad. Press, 1974. | Zbl 0317.94045

3. Munn, Free Inverse Semigroup, Proc. London Math. Soc., (3), vol. 29, 1974, p. 385-404. | MR 360881 | Zbl 0305.20033

6. Scheiblich, Free Inverse semigroups, Proc. Amer. Math. Soc., vol. 38, 1973, p. 1-7. | MR 310093 | Zbl 0256.20079

7. Shepherdson, The Reduction of Two-Way Automata to One-Way Automata, I.B.M. J. Res., vol. 3, n° 2, 1959, p. 198-200. | MR 103796 | Zbl 0158.25601

8. Pécuchet, Automates Boustrophédon et mots infin, T.C.S. (à paraître). | Zbl 0571.68074