Hiérarchies de concaténation
RAIRO. Inform. théor., 18 1 (1984) 23-46
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):
Algebraic Informatics
Jean-Éric PinLecture Notes in Computer Science, Algebraic Informatics 6742 44 (2011)
https://doi.org/10.1007/978-3-642-21493-6_3
THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\mathsf{DA}$
J. ALMEIDA and A. ESCADAInternational Journal of Algebra and Computation 14 (05n06) 525 (2004)
https://doi.org/10.1142/S0218196704001967
REFLEXIVE RELATIONS, EXTENSIVE TRANSFORMATIONS AND PIECEWISE TESTABLE LANGUAGES OF A GIVEN HEIGHT
M. V. VOLKOVInternational Journal of Algebra and Computation 14 (05n06) 817 (2004)
https://doi.org/10.1142/S0218196704002018
Infinite Words - Automata, Semigroups, Logic and Games
Pure and Applied Mathematics, Infinite Words - Automata, Semigroups, Logic and Games 141 499 (2004)https://doi.org/10.1016/S0079-8169(04)80014-X
Some complexity results for polynomial rational expressions
P.-C. HéamTheoretical Computer Science 299 (1-3) 735 (2003)
https://doi.org/10.1016/S0304-3975(01)00342-5
Algebraic tools for the concatenation product
Jean-Eric PinTheoretical Computer Science 292 (1) 317 (2003)
https://doi.org/10.1016/S0304-3975(01)00230-4
Automata, Languages and Programming
Jean-éric PinLecture Notes in Computer Science, Automata, Languages and Programming 1443 431 (1998)
https://doi.org/10.1007/BFb0055073
Trees, congruences and varieties of finite semigroups
F. Blanchet-SadriDiscrete Applied Mathematics 86 (2-3) 157 (1998)
https://doi.org/10.1016/S0166-218X(98)00040-7
Polynomial closure and unambiguous product
J. -E. Pin and P. WeilTheory of Computing Systems 30 (4) 383 (1997)
https://doi.org/10.1007/BF02679467
Inclusion relations between some congruences related to the dot-depth hierarchy
F. Blanchet-SadriDiscrete Applied Mathematics 68 (1-2) 33 (1996)
https://doi.org/10.1016/0166-218X(95)00047-U
Logic, semigroups and automata on words
Jean-Eric PinAnnals of Mathematics and Artificial Intelligence 16 (1) 343 (1996)
https://doi.org/10.1007/BF02127803
On semidirect and two-sided semidirect products of finite $\mathcal {J}$trivial monoids
F. Blanchet-SadriRAIRO - Theoretical Informatics and Applications 30 (5) 457 (1996)
https://doi.org/10.1051/ita/1996300504571
Schützenberger-like products in non-free monoids
Roman R. RedziejowskiRAIRO - Theoretical Informatics and Applications 29 (3) 209 (1995)
https://doi.org/10.1051/ita/1995290302091
Semigroups, Formal Languages and Groups
Jean-Eric PinSemigroups, Formal Languages and Groups 1 (1995)
https://doi.org/10.1007/978-94-011-0149-3_1
Equations on the semidirect product of a finite semilattice by a $\mathcal {J}$-trivial monoid of height $k$
F. Blanchet-SadriRAIRO - Theoretical Informatics and Applications 29 (3) 157 (1995)
https://doi.org/10.1051/ita/1995290301571
On a complete set of generators for dot-depth two
F. Blanchet-SadriDiscrete Applied Mathematics 50 (1) 1 (1994)
https://doi.org/10.1016/0166-218X(94)90161-9
Equations on the semidirect product of a finite semilattice by a finite commutative monoid
F. Blanchet-Sadri and Xin-Hong ZhangSemigroup Forum 49 (1) 67 (1994)
https://doi.org/10.1007/BF02573472
Automata, Languages and Programming
Imre SimonLecture Notes in Computer Science, Automata, Languages and Programming 700 430 (1993)
https://doi.org/10.1007/3-540-56939-1_92
Games, equations and dot-depth two monoids
F. Blanchet-SadriDiscrete Applied Mathematics 39 (2) 99 (1992)
https://doi.org/10.1016/0166-218X(92)90161-3
On iterated semidirect products of finite semilattices
Jorge AlmeidaJournal of Algebra 142 (1) 239 (1991)
https://doi.org/10.1016/0021-8693(91)90228-Z
Opérations polynomiales et hiérarchies de concaténation
Mustapha ArfiTheoretical Computer Science 91 (1) 71 (1991)
https://doi.org/10.1016/0304-3975(91)90268-7
On dot-depth two
F. Blanchet-SadriRAIRO - Theoretical Informatics and Applications 24 (6) 521 (1990)
https://doi.org/10.1051/ita/1990240605211
Games, equations and the dot-depth hierarchy
F. Blanchet-SadriComputers & Mathematics with Applications 18 (9) 809 (1989)
https://doi.org/10.1016/0898-1221(89)90179-X
Computation Theory and Logic
Wolfgang ThomasLecture Notes in Computer Science, Computation Theory and Logic 270 415 (1987)
https://doi.org/10.1007/3-540-18170-9_183
STACS 87
Mustapha ArfiLecture Notes in Computer Science, STACS 87 247 198 (1987)
https://doi.org/10.1007/BFb0039607
Inverse semigroups and varieties of finite semigroups
S.W Margolis and J.E PinJournal of Algebra 110 (2) 306 (1987)
https://doi.org/10.1016/0021-8693(87)90048-2
A property of the Schützenberger product
J. -E. PinSemigroup Forum 35 (1) 53 (1986)
https://doi.org/10.1007/BF02573090
On varieties of rational languages and variable length codes II
Stuart W. Margolis and Jean-Eric PinJournal of Pure and Applied Algebra 41 233 (1986)
https://doi.org/10.1016/0022-4049(86)90111-8
Fundamentals of Computation Theory
S. W. Margolis and J. E. PinLecture Notes in Computer Science, Fundamentals of Computation Theory 199 285 (1985)
https://doi.org/10.1007/BFb0028813
Une application de la representation matricielle des transductions
J.-E. Pin and J. SakarovitchTheoretical Computer Science 35 271 (1985)
https://doi.org/10.1016/0304-3975(85)90019-2