A more efficient notion of zigzag stability
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 3, pp. 181-194. 
@article{ITA_1996__30_3_181_0,
     author = {Le Sa\"ec, B. and Litovsky, I. and Patrou, B.},
     title = {A more efficient notion of zigzag stability},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {181--194},
     publisher = {EDP-Sciences},
     volume = {30},
     number = {3},
     year = {1996},
     mrnumber = {1415827},
     zbl = {0868.68072},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1996__30_3_181_0/}
}
TY  - JOUR
AU  - Le Saëc, B.
AU  - Litovsky, I.
AU  - Patrou, B.
TI  - A more efficient notion of zigzag stability
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1996
SP  - 181
EP  - 194
VL  - 30
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1996__30_3_181_0/
LA  - en
ID  - ITA_1996__30_3_181_0
ER  - 
%0 Journal Article
%A Le Saëc, B.
%A Litovsky, I.
%A Patrou, B.
%T A more efficient notion of zigzag stability
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1996
%P 181-194
%V 30
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1996__30_3_181_0/
%G en
%F ITA_1996__30_3_181_0
Le Saëc, B.; Litovsky, I.; Patrou, B. A more efficient notion of zigzag stability. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 30 (1996) no. 3, pp. 181-194. http://archive.numdam.org/item/ITA_1996__30_3_181_0/

1. M. Anselmo, Automates et codes zigzag, R.A.I.R.O. Theoretical Informatics and Applications, 1991, 25, 1, pp. 49-66. | Numdam | MR | Zbl

2. M. Anselmo, Sur les codes zigzag et leur décidabilité, Theoretical Computer Science, 1990, 74, pp. 341-354. | MR | Zbl

3. M. Anselmo, Automates bilatères et codes zigzag, Thèse L.I.T.P. 90-27, 1990.

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

5. Do Long Van, B. Le Saëc and I. Litovsky, On coding morphisms for zigzag codes, R.A.I.R.O. Theoretical Informatics and Applications, 1992, 26, 6, pp. 565-580. | Numdam | MR | Zbl

6. Do Long Van, B. Le Saëc and I. Litovsky, Stability for the zigzag submonoids, Theoretical Computer Science, 1993, 108, pp. 237-249. | MR | Zbl

7. M. Madonia, S. Salemi and T. Sportelli, On z-submonoids and z-codes, R.A.I.R.O. Theoretical Informatics and Applications, 1991, 25, 4, pp. 305-322. | Numdam | MR | Zbl

8. M. Madonia, S. Salemi and T. Sportelli, A generalization of Sardinas-Patterson algorithm to z-codes, Theoretical Computer Science, 1993, 108, pp. 251-270. | MR | Zbl

9. M. O. Rabin and D. Scott, Finite automata and their decision problems, IBM J. Res. Develop., 1959, 3, pp. 114-125. | MR | Zbl

10. M. P. Schutzenberger, Une théorie algébrique du codage, Séminaire Dubreil-Pisot, 1955-1956, Exposé No. 15. | Numdam | MR

11. J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res. Develop., 1959, 3, pp. 199-201. | MR | Zbl

12. M. Y. Vardi, A note on the reduction of two-way automata to one-way automata, Information Processing Letters, 1989, 30, pp. 261-264. | MR | Zbl