no. 4
Sur quelques classes d’applications de N 2 dans les ensembles finis
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 4, pp. 461-492. 
@article{ITA_1989__23_4_461_0,
     author = {Moulin Ollagnier, Jean},
     title = {Sur quelques classes d{\textquoteright}applications de $N^2$ dans les ensembles finis},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {461--492},
     publisher = {EDP-Sciences},
     volume = {23},
     number = {4},
     year = {1989},
     mrnumber = {1036697},
     zbl = {0689.68082},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1989__23_4_461_0/}
}
TY  - JOUR
AU  - Moulin Ollagnier, Jean
TI  - Sur quelques classes d’applications de $N^2$ dans les ensembles finis
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1989
SP  - 461
EP  - 492
VL  - 23
IS  - 4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1989__23_4_461_0/
LA  - fr
ID  - ITA_1989__23_4_461_0
ER  - 
%0 Journal Article
%A Moulin Ollagnier, Jean
%T Sur quelques classes d’applications de $N^2$ dans les ensembles finis
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1989
%P 461-492
%V 23
%N 4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1989__23_4_461_0/
%G fr
%F ITA_1989__23_4_461_0
Moulin Ollagnier, Jean. Sur quelques classes d’applications de $N^2$ dans les ensembles finis. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 23 (1989) no. 4, pp. 461-492. http://www.numdam.org/item/ITA_1989__23_4_461_0/

1 J. Berstel, Every Iterated Morphism Yields a co-CFL, Inform. Processing Letters, vol. 22, 1986, p. 7-9. | MR | Zbl

2 A. Cerny et J. Gruska, Modular Trellis Automata, preprint 1986, Fundamenta Informaticae (à paraître). | MR

3 A. Cerny et J. Gruska, Modular Trellises, preprint 1986. | MR

4 A. Cobham, On the Base-Dependence of Sets of Numbers Recognizable by Finite Automata, Math. Systems Theory, vol.3, 1969, p. 186-192. | MR | Zbl

5 A. Cobham, Uniform Tag Sequences, Math. Systems Theory, vol. 6, 1972, p. 164-192. | MR | Zbl

6 K. Culik, J. Gruska et A. Salomaa, Systolic Trellis Automata : Stability, Decidability and Complexity, Res. Report CS-82-04, Univ. of Waterloo, 1982.

7 K. Culik, J. Gruska et A. Salomaa, Systolic Trellis Automata, Intern. Jour. Computer Math., vol. 15, 1984, p. 195-212 et vol. 16, 1984, p. 3-22. | MR | Zbl

8 S. Eilenberg et M. P. Schutzenberger, Rational Sets in Commutative Monoids, Journal of Algebra, vol. 13, 1969, p. 173-191. | MR | Zbl

9 S. Ginsburg et E. H. Spanier, Bounded ALGOL-like Languages, Trans. Amer. Math. Soc., vol. 113, 1964, p. 333-368. | MR | Zbl

10 R. Ito, Every semilinear Set is a Finite Union of Disjoint linear Sets, J.C.S.S., vol. 8, 1969, p. 221-231. | MR | Zbl

11 I. Korec, Generalized Pascal Triangles: Decidability results, Acta Math. Univ. Comen., Bratislava, 1985 (à paraître). | MR | Zbl