Two-way automaton computations
RAIRO-Theor. Inf. Appl., 24 1 (1990) 47-66
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):
14215 115 (2023)
https://doi.org/10.1007/978-3-031-45329-8_6
1 (2017)
https://doi.org/10.1109/LICS.2017.8005138
Two-way representations and weighted automata
Sylvain LombardyRAIRO - Theoretical Informatics and Applications 50 (4) 331 (2016)
https://doi.org/10.1051/ita/2016026
Converting two-way nondeterministic unary automata into simpler automata
Viliam Geffert, Carlo Mereghetti and Giovanni PighizziniTheoretical Computer Science 295 (1-3) 189 (2003)
https://doi.org/10.1016/S0304-3975(02)00403-6
A solution of the word problem for free ∗-regular semigroups
Libor PolákJournal of Pure and Applied Algebra 157 (1) 107 (2001)
https://doi.org/10.1016/S0022-4049(00)00011-6
Stability for the zigzag submonoids
Do Long Van, Bertrand Le Saëc and Igor LitovskyTheoretical Computer Science 108 (2) 237 (1993)
https://doi.org/10.1016/0304-3975(93)90192-V
On coding morphisms for zigzag codes
Do Long Van, Bertrand Le Saëc and Igor LitovskyRAIRO - Theoretical Informatics and Applications 26 (6) 565 (1992)
https://doi.org/10.1051/ita/1992260605651
On $z$-submonoids and $z$-codes
M. Madonia, S. Salemi and T. SportelliRAIRO - Theoretical Informatics and Applications 25 (4) 305 (1991)
https://doi.org/10.1051/ita/1991250403051