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:

Efficient algorithms for membership in boolean hierarchies of regular languages

Christian Glaßer, Heinz Schmitz and Victor Selivanov
Theoretical Computer Science 646 86 (2016)
https://doi.org/10.1016/j.tcs.2016.07.017

Computer Science - Theory and Applications

Lukas Fleischer, Manfred Kufleitner and Alexander Lauser
Lecture Notes in Computer Science, Computer Science - Theory and Applications 8476 176 (2014)
https://doi.org/10.1007/978-3-319-06686-8_14

Structural Theory of Automata, Semigroups, and Universal Algebra

Jorge Almeida
NATO Science Series II: Mathematics, Physics and Chemistry, Structural Theory of Automata, Semigroups, and Universal Algebra 207 1 (2005)
https://doi.org/10.1007/1-4020-3817-8_1

The globals of pseudovarieties of ordered semigroups containingB2and an application to a problem proposed by Pin

Jorge Almeida and Ana P. Escada
RAIRO - Theoretical Informatics and Applications 39 (1) 1 (2005)
https://doi.org/10.1051/ita:2005001

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)
https://doi.org/10.1016/S0304-3975(02)00848-4

A conjecture on the concatenation product

Jean-Eric Pin and Pascal Weil
RAIRO - Theoretical Informatics and Applications 35 (6) 597 (2001)
https://doi.org/10.1051/ita:2001134

FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science

Christian Gla\er and Heinz Schmitz
Lecture Notes in Computer Science, FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science 1974 503 (2000)
https://doi.org/10.1007/3-540-44450-5_41

Automata, Languages and Programming

Jean-éric Pin
Lecture Notes in Computer Science, Automata, Languages and Programming 1443 431 (1998)
https://doi.org/10.1007/BFb0055073

Semigroups whose idempotents form a subsemigroup

Jean-Camille Birget, Stuart Margolis and John Rhodes
Bulletin of the Australian Mathematical Society 41 (2) 161 (1990)
https://doi.org/10.1017/S0004972700017986

Formal Properties of Finite Automata and Applications

Pascal Weil
Lecture Notes in Computer Science, Formal Properties of Finite Automata and Applications 386 120 (1989)
https://doi.org/10.1007/BFb0013116