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):

Efficient algorithms for membership in boolean hierarchies of regular languages

Christian Glaßer, Heinz Schmitz and Victor Selivanov
Theoretical Computer Science 646 86 (2016)
DOI: 10.1016/j.tcs.2016.07.017
See this article

Polynomial closure and unambiguous product

J. -E. Pin and P. Weil
Theory of Computing Systems 30 (4) 383 (1997)
DOI: 10.1007/BF02679467
See this article

The Half-Levels of the FO2 Alternation Hierarchy

Lukas Fleischer, Manfred Kufleitner and Alexander Lauser
Theory of Computing Systems (2016)
DOI: 10.1007/s00224-016-9712-2
See this article

Equations and monoid varieties of dot-depth one and two

F. Blanchet-Sadri
Theoretical Computer Science 123 (2) 239 (1994)
DOI: 10.1016/0304-3975(92)00064-X
See this article

Computer Science – Theory and Applications

Thomas Place and Marc Zeitoun
Lecture Notes in Computer Science, Computer Science – Theory and Applications 10304 25 (2017)
DOI: 10.1007/978-3-319-58747-9_5
See this article

Languages polylog-time reducible to dot-depth 1/2

Christian Glaßer
Journal of Computer and System Sciences 73 (1) 36 (2007)
DOI: 10.1016/j.jcss.2006.09.004
See this article

Programs over semigroups of dot-depth one

Alexis Maciel, Pierre Péladeau and Denis Thérien
Theoretical Computer Science 245 (1) 135 (2000)
DOI: 10.1016/S0304-3975(99)00278-9
See this article

On a conjecture concerning dot-depth two languages

H. Straubing and P. Weil
Theoretical Computer Science 104 (2) 161 (1992)
DOI: 10.1016/0304-3975(92)90121-U
See this article

Games, equations and the dot-depth hierarchy

F. Blanchet-Sadri
Computers & Mathematics with Applications 18 (9) 809 (1989)
DOI: 10.1016/0898-1221(89)90179-X
See this article

Inverse monoids of dot-depth two

Pascal Weil
Theoretical Computer Science 66 (3) 233 (1989)
DOI: 10.1016/0304-3975(89)90151-5
See this article

Complexity of some problems from the theory of automata

Jacques Stern
Information and Control 66 (3) 163 (1985)
DOI: 10.1016/S0019-9958(85)80058-9
See this article

Profinite categories and semidirect products

J. Almeida and P. Weil
Journal of Pure and Applied Algebra 123 (1-3) 1 (1998)
DOI: 10.1016/S0022-4049(96)00083-7
See this article

Games, equations and dot-depth two monoids

F. Blanchet-Sadri
Discrete Applied Mathematics 39 (2) 99 (1992)
DOI: 10.1016/0166-218X(92)90161-3
See this article

Algebraic tools for the concatenation product

Jean-Eric Pin
Theoretical Computer Science 292 (1) 317 (2003)
DOI: 10.1016/S0304-3975(01)00230-4
See this article

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata

Pál Dömösi, Chrystopher L. Nehaniv and John L. Rhodes
Theoretical Computer Science 302 (1-3) 295 (2003)
DOI: 10.1016/S0304-3975(02)00848-4
See this article

Characterizations of some classes of regular events

Jacques Stern
Theoretical Computer Science 35 17 (1985)
DOI: 10.1016/0304-3975(85)90003-9
See this article

On varieties of rational languages and variable length codes II

Stuart W. Margolis and Jean-Eric Pin
Journal of Pure and Applied Algebra 41 233 (1986)
DOI: 10.1016/0022-4049(86)90111-8
See this article

Profinite categories, implicit operations and pseudovarieties of categories

Peter R. Jones
Journal of Pure and Applied Algebra 109 (1) 61 (1996)
DOI: 10.1016/0022-4049(95)00074-7
See this article

Algebraic Informatics

Jean-Éric Pin
Lecture Notes in Computer Science, Algebraic Informatics 6742 44 (2011)
DOI: 10.1007/978-3-642-21493-6_3
See this article

Inclusion relations between some congruences related to the dot-depth hierarchy

F. Blanchet-Sadri
Discrete Applied Mathematics 68 (1-2) 33 (1996)
DOI: 10.1016/0166-218X(95)00047-U
See this article