Iteration of rational transductions
RAIRO-Theor. Inf. Appl., 34 2 (2000) 99-129
Published online: 2002-04-15
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):
On prefixal one-rule string rewrite systems
Michel Latteux and Yves RoosTheoretical Computer Science 795 240 (2019)
https://doi.org/10.1016/j.tcs.2019.07.004
Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
Liyong Lin, Alin Stefanescu, Weilin Wang, Rong Su and W. Murray WonhamAutomatica 87 290 (2018)
https://doi.org/10.1016/j.automatica.2017.10.015
Consensus Game Acceptors and Iterated Transductions
Dietmar Berwanger and Marie van den BogaardInternational Journal of Foundations of Computer Science 29 (02) 165 (2018)
https://doi.org/10.1142/S0129054118400026
A canonical automaton for one-rule length-preserving string rewrite systems
Michel Latteux and Yves RoosInformation and Computation 244 203 (2015)
https://doi.org/10.1016/j.ic.2015.07.002
A Kleene characterization of computability
Joost EngelfrietInformation Processing Letters 101 (4) 139 (2007)
https://doi.org/10.1016/j.ipl.2006.09.003
An Exercise on Fibonacci Representations
Jean BerstelRAIRO - Theoretical Informatics and Applications 35 (6) 491 (2001)
https://doi.org/10.1051/ita:2001127