Sequential mappings of $\omega $-languages
RAIRO-Theor. Inf. Appl., 21 2 (1987) 147-173
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Topologies for Finite Words: Compatibility with the Cantor Topology
Ludwig StaigerRAIRO - Theoretical Informatics and Applications 58 2 (2024)
https://doi.org/10.1051/ita/2024002
Shift-invariant topologies for the Cantor space X
Stefan Hoffmann, Sibylle Schwarz and Ludwig StaigerTheoretical Computer Science 679 145 (2017)
https://doi.org/10.1016/j.tcs.2016.10.003
Topology on words
Cristian S. Calude, Helmut Jürgensen and Ludwig StaigerTheoretical Computer Science 410 (24-25) 2323 (2009)
https://doi.org/10.1016/j.tcs.2009.02.029
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
A topological characterization of random sequences
Cristian S. Calude, Solomon Marcus and Ludwig StaigerInformation Processing Letters 88 (5) 245 (2003)
https://doi.org/10.1016/j.ipl.2003.07.002
Automata, Languages and Programming
Marie-Pierre Béal and Olivier CartonLecture Notes in Computer Science, Automata, Languages and Programming 1853 561 (2000)
https://doi.org/10.1007/3-540-45022-X_47
339 (1997)
https://doi.org/10.1007/978-3-642-59126-6_6
New Trends in Formal Languages
Ludwig StaigerLecture Notes in Computer Science, New Trends in Formal Languages 1218 377 (1997)
https://doi.org/10.1007/3-540-62844-4_27
Collegium Logicum
Rudolf Freund and Ludwig StaigerCollegium Logicum, Collegium Logicum 2 118 (1996)
https://doi.org/10.1007/978-3-7091-9461-4_8
STACS 93
Ludwig StaigerLecture Notes in Computer Science, STACS 93 665 629 (1993)
https://doi.org/10.1007/3-540-56503-5_62
X-automata on ω-words
Joost Engelfriet and Hendrik Jan HoogeboomTheoretical Computer Science 110 (1) 1 (1993)
https://doi.org/10.1016/0304-3975(93)90349-X
Mathematical Foundations of Computer Science 1990
M. Latteux and E. TimmermanLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1990 452 407 (1990)
https://doi.org/10.1007/BFb0029636
The three subfamilies of rational ω-languages closed under ω-transduction
E. TimmermanTheoretical Computer Science 76 (2-3) 243 (1990)
https://doi.org/10.1016/0304-3975(90)90018-D