EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 20 / No 4 (1986) RAIRO-Theor. Inf. Appl., 20 4 (1986) 483-494 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 20, Number 4, 1986
Page(s) 483 - 494
DOI https://doi.org/10.1051/ita/1986200404831
Published online 01 February 2017
  1. BN. L. BOASSON and M. NIVAT, Adherences of languages, J. Comput. System Sci., Vol. 20, 1980, pp. 285-309. [MR: 584863] [Zbl: 0471.68052] [Google Scholar]
  2. 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] [Google Scholar]
  3. 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] [Google Scholar]
  4. 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] [Google Scholar]
  5. D 1. Do L. V., Codes avec des mots infinis. RAIRO Inform. Theor., Vol. 16, 1982, pp. 371-386. [MR: 707638] [Zbl: 0498.68053] [Google Scholar]
  6. D 2. Do L. V., Sous-monoides et codes avec des mots infinis, Semigroup Forum, Vol. 26, 1983, pp. 75-87. [EuDML: 134593] [MR: 685117] [Zbl: 0504.68054] [Google Scholar]
  7. D 3. Do L. V., Contribution to combinatorics on words, Diss. B. Humboldt-Univ., Berlin, 1985. [Google Scholar]
  8. 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] [Google Scholar]
  9. 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] [Google Scholar]
  10. LS. R. LINDER und L. STAIGER, Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin 1977. [MR: 469495] [Zbl: 0363.94016] [Google Scholar]
  11. 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] [Google Scholar]
  12. Sh. St J. SHYR, Free Monoids and Languages, Lecture Notes, Soochow Univ., Taipei, 1979. [Zbl: 0407.68076] [Google Scholar]
  13. 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] [Google Scholar]
  14. S 2. L. STAIGER, Zur Topologie der regulären Mengen, Diss. A., Friedrich-Schiller-Univ., Jena, 1976. [Google Scholar]
  15. S 3. L. STAIGER, A note on connected ω-languages, Elektron. Inf. verarb. Kybernetik, Vol. 16, 1980, pp. 245-251. [Zbl: 0452.68085] [Google Scholar]
  16. W. K. WAGNER, On ω-regular sets, Information and Control, Vol. 43, 1979, pp. 123-177. [Zbl: 0434.68061] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.