no. 3-4
Bijective sequential mappings of a free monoid onto another
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 265-276. 
@article{ITA_1994__28_3-4_265_0,
     author = {Choffrut, C.},
     title = {Bijective sequential mappings of a free monoid onto another},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {265--276},
     publisher = {EDP-Sciences},
     volume = {28},
     number = {3-4},
     year = {1994},
     mrnumber = {1282448},
     zbl = {0883.68063},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1994__28_3-4_265_0/}
}
TY  - JOUR
AU  - Choffrut, C.
TI  - Bijective sequential mappings of a free monoid onto another
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1994
SP  - 265
EP  - 276
VL  - 28
IS  - 3-4
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1994__28_3-4_265_0/
LA  - en
ID  - ITA_1994__28_3-4_265_0
ER  - 
%0 Journal Article
%A Choffrut, C.
%T Bijective sequential mappings of a free monoid onto another
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1994
%P 265-276
%V 28
%N 3-4
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1994__28_3-4_265_0/
%G en
%F ITA_1994__28_3-4_265_0
Choffrut, C. Bijective sequential mappings of a free monoid onto another. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 28 (1994) no. 3-4, pp. 265-276. http://www.numdam.org/item/ITA_1994__28_3-4_265_0/

1. J. Berstel and L. Boasson, Context-Free Languages, Elsevier, 1990, chapter 2, pp. 61-100. | MR | Zbl

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

3. J. Berstel and C. Reutenauer, Rational Series and Their Languages, volume 12 of EATCS Monograph on Theoretical Computer Science, Academic Press, 1988. | MR | Zbl

4. J. H. Conway, Regular Algebra and Finite Machines, Chapman and Hall, London, 1971. | Zbl

5. S. Eilenberg, Automctta, Languages and Machines, volume A. Academic Press, 1974. | Zbl

6. S. Ginsburg and G. F. Rose, A characterization of machine mappings, Can. J. Math., 1966, 18, pp. 381-388. | MR | Zbl

7. H. A. Maurer and M. Nivat, Rational bijections of rational sets, Acta Informatica, 1980, 13, pp. 365-378. | MR | Zbl

8. R. Mac Naughton, A decision procedure for generalized mappability-onto of regular sets, manuscript.

9. K. B. Samolon, The decidability of a mapping problem for generalized sequential machines with final states, J. of Comput. and Sys. Sci., 1975, 10, 2, pp. 200-218. | MR | Zbl