no. 4
On infinitary finite length codes
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 4, pp. 483-494. 
@article{ITA_1986__20_4_483_0,
     author = {Staiger, Ludwig},
     title = {On infinitary finite length codes},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {483--494},
     publisher = {AFCET - Gauthier-Villars},
     address = {Paris},
     volume = {20},
     number = {4},
     year = {1986},
     mrnumber = {880849},
     zbl = {0628.68056},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1986__20_4_483_0/}
}
TY  - JOUR
AU  - Staiger, Ludwig
TI  - On infinitary finite length codes
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1986
SP  - 483
EP  - 494
VL  - 20
IS  - 4
PB  - AFCET - Gauthier-Villars
PP  - Paris
UR  - http://www.numdam.org/item/ITA_1986__20_4_483_0/
LA  - en
ID  - ITA_1986__20_4_483_0
ER  - 
%0 Journal Article
%A Staiger, Ludwig
%T On infinitary finite length codes
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1986
%P 483-494
%V 20
%N 4
%I AFCET - Gauthier-Villars
%C Paris
%U http://www.numdam.org/item/ITA_1986__20_4_483_0/
%G en
%F ITA_1986__20_4_483_0
Staiger, Ludwig. On infinitary finite length codes. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986) no. 4, pp. 483-494. http://www.numdam.org/item/ITA_1986__20_4_483_0/

BN. L. Boasson and M. Nivat, Adherences of languages, J. Comput. System Sci., Vol. 20, 1980, pp. 285-309. | MR | Zbl

C 1. R. M. Capocelli, A note on uniquely decipherable codes, IEEE Trans. Information Theory, vol. IT-25, 1979, pp. 90-94. | MR | Zbl

C2. R. M. Capocelli, On weakly prefix subsemigroups of a free semigroup in: Advances in Communications, D. G. LAINIOTIS and N. S. TSANNES, Eds, D. Reidel, Dordrecht 1980, pp. 123-129. | MR | Zbl

Da. M. Davis, Infinite games of perfect Information, in: Advances in Game Theory. Ann. of Mathematical Studies, No. 52, 1964, pp. 85-101. | MR | Zbl

D 1. Do L. V., Codes avec des mots infinis. RAIRO Inform. Theor., Vol. 16, 1982, pp. 371-386. | Numdam | MR | Zbl

D 2. Do L. V., Sous-monoides et codes avec des mots infinis, Semigroup Forum, Vol. 26, 1983, pp. 75-87. | MR | Zbl

D 3. Do L. V., Contribution to combinatorics on words, Diss. B. Humboldt-Univ., Berlin, 1985.

DK. P. Darondeau and L. Kott, A formal proof System for infinitary rational expressions in: Automata on Infinite Words, M. NIVAT and D. PERRIN Eds, Lecture Notes in Computer Science, No. 192, Springer-Verlag, Berlin 1985, pp. 68-80. | MR | Zbl

L. V. I. Levenshtein, Some properties of coding and self adjusting automata for decoding messages, Problemy Kibernetiki, Vol. 11, 1964, pp. 63-121. | MR | Zbl

LS. R. Linder und L. Staiger, Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin 1977. | MR | Zbl

Sc. N. P. Schützenberger, On a question concerning certain free submonoids, J. Combinatorial Theory, Vol. 1, 1966, pp. 437-442. | MR | Zbl

Sh. St J. Shyr, Free Monoids and Languages, Lecture Notes, Soochow Univ., Taipei, 1979. | Zbl

S 1. L. Staiger, Eine Bemerkung zur Charakterisierung von Folgenmengen durch Wortmengen, Elektron. Inf. verarb. Kybernetik, Vol. 8, 1972, pp. 589-592. | MR | Zbl

S 2. L. Staiger, Zur Topologie der regulären Mengen, Diss. A., Friedrich-Schiller-Univ., Jena, 1976.

S 3. L. Staiger, A note on connected ω-languages, Elektron. Inf. verarb. Kybernetik, Vol. 16, 1980, pp. 245-251. | Zbl

W. K. Wagner, On ω-regular sets, Information and Control, Vol. 43, 1979, pp. 123-177. | Zbl