Cônes rationnels commutativement clos
RAIRO. Inform. théor., 11 1 (1977) 29-51
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):
15840 179 (2025)
https://doi.org/10.1007/978-3-031-97274-4_11
000025 (2025)
https://doi.org/10.1109/SISY67000.2025.11205421
Refining the hierarchy of blind multicounter languages and twist-closed trios
Matthias Jantzen and Alexy KurganskyyInformation and Computation 185 (2) 159 (2003)
https://doi.org/10.1016/S0890-5401(03)00087-7
STACS 98
Matthias JantzenLecture Notes in Computer Science, STACS 98 1373 344 (1998)
https://doi.org/10.1007/BFb0028573
Machines, Languages, and Complexity
Michel LatteuxLecture Notes in Computer Science, Machines, Languages, and Complexity 381 37 (1989)
https://doi.org/10.1007/BFb0015926
Every commutative quasirational language is regular
Juha KortelainenRAIRO - Theoretical Informatics and Applications 20 (3) 319 (1986)
https://doi.org/10.1051/ita/1986200303191
Single-tape reset machines
S. A. Greibach and C. WrathallRAIRO - Theoretical Informatics and Applications 20 (1) 55 (1986)
https://doi.org/10.1051/ita/1986200100551
Automata, Languages and Programming
Juha KortelainenLecture Notes in Computer Science, Automata, Languages and Programming 194 348 (1985)
https://doi.org/10.1007/BFb0015760
Langages á un Compteur
Michel LatteuxJournal of Computer and System Sciences 26 (1) 14 (1983)
https://doi.org/10.1016/0022-0000(83)90018-1
Morphismes et bimorphismes d'arbres
A. Arnold and M. DauchetTheoretical Computer Science 20 (1) 33 (1982)
https://doi.org/10.1016/0304-3975(82)90098-6
A result concerning the trios generated by commutative slip-languages
Juha KortelainenDiscrete Applied Mathematics 4 (3) 233 (1982)
https://doi.org/10.1016/0166-218X(82)90045-2
Indécidabilité de la condition IRS
Jean-Michel Autebert, Joffroy Beauquier, Luc Boasson and Michel LatteuxRAIRO. Informatique théorique 16 (2) 129 (1982)
https://doi.org/10.1051/ita/1982160201291
Fundamentals of Computation Theory
Juha KortelainenLecture Notes in Computer Science, Fundamentals of Computation Theory 117 210 (1981)
https://doi.org/10.1007/3-540-10854-8_23
Theoretical Computer Science
Michel LatteuxLecture Notes in Computer Science, Theoretical Computer Science 104 52 (1981)
https://doi.org/10.1007/BFb0017296
Unary multiple equality sets: The languages of rational matrices
Franz-Josef BrandenburgInformation and Control 50 (3) 199 (1981)
https://doi.org/10.1016/S0019-9958(81)90335-1
On some bounded semiAFLs and AFLs
Paavo TurakainenInformation Sciences 23 (1) 31 (1981)
https://doi.org/10.1016/0020-0255(81)90039-6
Transduction rationnelle, substitution et complémentaire
Michel LatteuxInformation and Control 45 (3) 285 (1980)
https://doi.org/10.1016/S0019-9958(80)90670-1
Sur les g�n�rateurs alg�briques et lin�aires
Michel LatteuxActa Informatica 13 (4) 347 (1980)
https://doi.org/10.1007/BF00288769
Net Theory and Applications
M. Jantzen and R. ValkLecture Notes in Computer Science, Net Theory and Applications 84 165 (1980)
https://doi.org/10.1007/3-540-10001-6_23
Substitutions dans les EDT0L systèmes ultralinéaires
Michel LatteuxInformation and Control 42 (2) 194 (1979)
https://doi.org/10.1016/S0019-9958(79)90641-7
Intersections de langages alg�briques born�s
Michel LatteuxActa Informatica 11 (3) 233 (1979)
https://doi.org/10.1007/BF00289069
Theoretical Computer Science 4th GI Conference
M. LatteuxLecture Notes in Computer Science, Theoretical Computer Science 4th GI Conference 67 182 (1979)
https://doi.org/10.1007/3-540-09118-1_20
On the hierarchy of Petri net languages
Matthias JantzenRAIRO. Informatique théorique 13 (1) 19 (1979)
https://doi.org/10.1051/ita/1979130100191
Cônes rationnels commutatifs
Michel LatteuxJournal of Computer and System Sciences 18 (3) 307 (1979)
https://doi.org/10.1016/0022-0000(79)90039-4
Theoretical Computer Science 4th GI Conference
Matthias JantzenLecture Notes in Computer Science, Theoretical Computer Science 4th GI Conference 67 158 (1979)
https://doi.org/10.1007/3-540-09118-1_18
Recursivite et cones rationnels fermes par intersection
A. Arnold and M. LatteuxCalcolo 15 (4) 381 (1978)
https://doi.org/10.1007/BF02576519
Note sur la non-principalité de certaines FAL
F. RodriguezRAIRO. Informatique théorique 12 (3) 181 (1978)
https://doi.org/10.1051/ita/1978120301811
Automata, Languages and Programming
A. Arnold and M. DauchetLecture Notes in Computer Science, Automata, Languages and Programming 62 26 (1978)
https://doi.org/10.1007/3-540-08860-1_3
Remarks on blind and partially blind one-way multicounter machines
S.A. GreibachTheoretical Computer Science 7 (3) 311 (1978)
https://doi.org/10.1016/0304-3975(78)90020-8
Mots infinis et langages commutatifs
Michel LatteuxRAIRO. Informatique théorique 12 (3) 185 (1978)
https://doi.org/10.1051/ita/1978120301851
The strong independence of substitution and homomorphic replication
S. A. GreibachRAIRO. Informatique théorique 12 (3) 213 (1978)
https://doi.org/10.1051/ita/1978120302131
Une note sur la propriété de préfixe
Michel LatteuxMathematical Systems Theory 11 (1) 235 (1977)
https://doi.org/10.1007/BF01768478