@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. Informatique th\'eorique},
pages = {71--100},
year = {1985},
publisher = {EDP Sciences},
volume = {19},
number = {1},
mrnumber = {795773},
zbl = {0604.68094},
language = {fr},
url = {https://www.numdam.org/item/ITA_1985__19_1_71_0/}
}
Pécuchet, J. P. Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre. RAIRO. Informatique théorique, Tome 19 (1985) no. 1, pp. 71-100. https://www.numdam.org/item/ITA_1985__19_1_71_0/
1. , et , Time and Tape Complexity of Pushdown Automaton Languages, Information and Control, vol. 13, n° 3, 1968, p. 186-206. | Zbl
2. , Transductions and Context-Free Languages, Teubner, 1979. | Zbl | MR
3. , , Un. of California, Berkeley, 1983.
4. , Automata, Languages and Machines, Vol. A, Acad. Press, 1974. | Zbl
3. , Free Inverse Semigroup, Proc. London Math. Soc., (3), vol. 29, 1974, p. 385-404. | Zbl | MR
6. , Free Inverse semigroups, Proc. Amer. Math. Soc., vol. 38, 1973, p. 1-7. | Zbl | MR
7. , The Reduction of Two-Way Automata to One-Way Automata, I.B.M. J. Res., vol. 3, n° 2, 1959, p. 198-200. | Zbl | MR
8. , Automates Boustrophédon et mots infin, T.C.S. (à paraître). | Zbl






