On infinitary finite length codes
Staiger, Ludwig
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 20 (1986), p. 483-494 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@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},
     volume = {20},
     year = {1986},
     pages = {483-494},
     mrnumber = {880849},
     zbl = {0628.68056},
     language = {en},
     url = {http://dml.mathdoc.fr/item/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) pp. 483-494. http://gdmltest.u-ga.fr/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 584863 | Zbl 0471.68052

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

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 615938 | Zbl 0474.94032

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

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

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

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 814733 | Zbl 0575.68083

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

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

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

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

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

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 0452.68085

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