Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre
RAIRO. Inform. théor., 19 1 (1985) 71-100
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):
217 (2016)
https://doi.org/10.1145/2933575.2935315
Two-way representations and weighted automata
Sylvain LombardyRAIRO - Theoretical Informatics and Applications 50 (4) 331 (2016)
https://doi.org/10.1051/ita/2016026
On labeled birooted tree languages: Algebras, automata and logic
David JaninInformation and Computation 243 222 (2015)
https://doi.org/10.1016/j.ic.2014.12.016
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
Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
Jean-Camille BirgetJournal of Computer and System Sciences 45 (2) 154 (1992)
https://doi.org/10.1016/0022-0000(92)90045-K
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
Automates et codes zigzag
Marcella AnselmoRAIRO - Theoretical Informatics and Applications 25 (1) 49 (1991)
https://doi.org/10.1051/ita/1991250100491
Automata, Languages and Programming
M. AnselmoLecture Notes in Computer Science, Automata, Languages and Programming 443 88 (1990)
https://doi.org/10.1007/BFb0032024
Two-way automaton computations
Jean-Camille BirgetRAIRO - Theoretical Informatics and Applications 24 (1) 47 (1990)
https://doi.org/10.1051/ita/1990240100471
Concatenation of inputs in a two-way automaton
Jean-Camille BirgetTheoretical Computer Science 63 (2) 141 (1989)
https://doi.org/10.1016/0304-3975(89)90075-3
Formal Properties of Finite Automata and Applications
Jean-Camille BirgetLecture Notes in Computer Science, Formal Properties of Finite Automata and Applications 386 56 (1989)
https://doi.org/10.1007/BFb0013111
The Dyck language D'1∗ is not generated by any matrix grammar of finite index
Brigitte RozoyInformation and Computation 74 (1) 64 (1987)
https://doi.org/10.1016/0890-5401(87)90012-5
Outils et résultats pour les transducteurs boustrophédons
Brigitte RozoyRAIRO - Theoretical Informatics and Applications 20 (3) 221 (1986)
https://doi.org/10.1051/ita/1986200302211
Automates boustrophédon et mots infinis
Jean-Pierre PécuchetTheoretical Computer Science 35 115 (1985)
https://doi.org/10.1016/0304-3975(85)90009-X