Transductions rationnelles décroissantes
RAIRO. Inform. théor., 15 2 (1981) 141-148
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):
Language and Automata Theory and Applications
Luc Boasson and Olivier CartonLecture Notes in Computer Science, Language and Automata Theory and Applications 8977 716 (2015)
https://doi.org/10.1007/978-3-319-15579-1_56
Some Characterization of Recursively Enumerable Sets
Wit ForyśInternational Journal of Computer Mathematics 79 (2) 157 (2002)
https://doi.org/10.1080/00207160211924
Iteration of rational transductions
Alain Terlutte and David SimplotRAIRO - Theoretical Informatics and Applications 34 (2) 99 (2000)
https://doi.org/10.1051/ita:2000109
Synchronized rational relations of finite and infinite words
Christiane Frougny and Jacques SakarovitchTheoretical Computer Science 108 (1) 45 (1993)
https://doi.org/10.1016/0304-3975(93)90230-Q
STACS 91
Christiane Frougny and Jacques SakarovitchLecture Notes in Computer Science, STACS 91 480 50 (1991)
https://doi.org/10.1007/BFb0020787
STACS 88
Alain TerlutteLecture Notes in Computer Science, STACS 88 294 149 (1988)
https://doi.org/10.1007/BFb0035841
Mathematical Foundations of Computer Science 1986
Jean Berstel and Jacques SakarovitchLecture Notes in Computer Science, Mathematical Foundations of Computer Science 1986 233 15 (1986)
https://doi.org/10.1007/BFb0016231
On the usefulness of bifaithful rational cones
Michel Latteux and Jeannine LeguyMathematical Systems Theory 18 (1) 19 (1985)
https://doi.org/10.1007/BF01699459
Partial commutations and faithful rational transductions
M. Clerbout and M. LatteuxTheoretical Computer Science 34 (3) 241 (1984)
https://doi.org/10.1016/0304-3975(84)90053-7
Automata, Languages and Programming
M. Latteux and J. LeguyLecture Notes in Computer Science, Automata, Languages and Programming 154 420 (1983)
https://doi.org/10.1007/BFb0036926
Langages satur�s et c�nes d�croissants langages et c�nes bifid�les
Jeannine LeguyActa Informatica 18 (1) 65 (1982)
https://doi.org/10.1007/BF00625281
Fundamentals of Computation Theory
Jeannine LeguyLecture Notes in Computer Science, Fundamentals of Computation Theory 117 234 (1981)
https://doi.org/10.1007/3-540-10854-8_26