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:
Robert Knast
RAIRO. Inform. théor., 17 4 (1983) 321-330
Published online: 2017-02-01
This article has been cited by the following article(s):
61 articles
Closing star-free closure
Thomas Place and Marc Zeitoun ACM Transactions on Computational Logic (2025) https://doi.org/10.1145/3733831
Computer Science – Theory and Applications
Thomas Place and Marc Zeitoun Lecture Notes in Computer Science, Computer Science – Theory and Applications 13296 320 (2022) https://doi.org/10.1007/978-3-031-09574-0_20
Adding Successor
Thomas Place and Marc Zeitoun ACM Transactions on Computational Logic 21 (2) 1 (2020) https://doi.org/10.1145/3356339
Thomas Place 12038 89 (2020) https://doi.org/10.1007/978-3-030-40608-0_6
Thomas Place and Marc Zeitoun 1 (2019) https://doi.org/10.1109/LICS.2019.8785655
Generic Results for Concatenation Hierarchies
Thomas Place and Marc Zeitoun Theory of Computing Systems 63 (4) 849 (2019) https://doi.org/10.1007/s00224-018-9867-0
The Half-Levels of the FO2 Alternation Hierarchy
Lukas Fleischer, Manfred Kufleitner and Alexander Lauser Theory of Computing Systems 61 (2) 352 (2017) https://doi.org/10.1007/s00224-016-9712-2
Thomas Place and Marc Zeitoun 1 (2017) https://doi.org/10.1109/LICS.2017.8005070
Thomas Place and Marc Zeitoun 10304 25 (2017) https://doi.org/10.1007/978-3-319-58747-9_5
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
Fundamentals of Computation Theory
Luc Dartois and Charles Paperman Lecture Notes in Computer Science, Fundamentals of Computation Theory 9210 160 (2015) https://doi.org/10.1007/978-3-319-22177-9_13
The tale of the quantifier alternation hierarchy of first-order logic over words
Thomas Place and Marc Zeitoun ACM SIGLOG News 2 (3) 4 (2015) https://doi.org/10.1145/2815493.2815495
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
AROUND DOT-DEPTH ONE
MANFRED KUFLEITNER and ALEXANDER LAUSER International Journal of Foundations of Computer Science 23 (06) 1323 (2012) https://doi.org/10.1142/S0129054112400552
Algebraic Informatics
Jean-Éric Pin Lecture Notes in Computer Science, Algebraic Informatics 6742 44 (2011) https://doi.org/10.1007/978-3-642-21493-6_3
Manfred Kufleitner and Alexander Lauser 23 (2011) https://doi.org/10.1109/LICS.2011.24
Languages polylog-time reducible to dot-depth 1/2
Christian Glaßer Journal of Computer and System Sciences 73 (1) 36 (2007) https://doi.org/10.1016/j.jcss.2006.09.004
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
STACS 2005
Christian Glaßer Lecture Notes in Computer Science, STACS 2005 3404 170 (2005) https://doi.org/10.1007/978-3-540-31856-9_14
Imre Simon: an exceptional graduate student
Denis Thérien RAIRO - Theoretical Informatics and Applications 39 (1) 297 (2005) https://doi.org/10.1051/ita:2005017
Algebraic tools for the concatenation product
Jean-Eric Pin Theoretical Computer Science 292 (1) 317 (2003) https://doi.org/10.1016/S0304-3975(01)00230-4
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
PROFINITE METHODS IN SEMIGROUP THEORY
PASCAL WEIL International Journal of Algebra and Computation 12 (01n02) 137 (2002) https://doi.org/10.1142/S0218196702000912
ORDERED CATEGORIES AND ORDERED SEMIGROUPS
Jean-Eric Pin, Arnaud Pinguet and Pascal Weil Communications in Algebra 30 (12) 5651 (2002) https://doi.org/10.1081/AGB-120016004
THE WREATH PRODUCT PRINCIPLE FOR ORDERED SEMIGROUPS
Jean-Eric Pin and Pascal Weil Communications in Algebra 30 (12) 5677 (2002) https://doi.org/10.1081/AGB-120016005
Developments in Language Theory
Christian Glaßer and Heinz Schmitz Lecture Notes in Computer Science, Developments in Language Theory 2295 251 (2002) https://doi.org/10.1007/3-540-46011-X_21
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
Algorithmic Problems in Groups and Semigroups
Karsten Henckell and Jean-Eric Pin Algorithmic Problems in Groups and Semigroups 121 (2000) https://doi.org/10.1007/978-1-4612-1388-8_6
STACS 2000
Christian Glaßer and Heinz Schmitz Lecture Notes in Computer Science, STACS 2000 1770 555 (2000) https://doi.org/10.1007/3-540-46541-3_46
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
Programs over semigroups of dot-depth one
Alexis Maciel, Pierre Péladeau and Denis Thérien Theoretical Computer Science 245 (1) 135 (2000) https://doi.org/10.1016/S0304-3975(99)00278-9
Profinite categories and semidirect products
J. Almeida and P. Weil Journal of Pure and Applied Algebra 123 (1-3) 1 (1998) https://doi.org/10.1016/S0022-4049(96)00083-7
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
Handbook of Formal Languages
Jean-Eric Pin Handbook of Formal Languages 679 (1997) https://doi.org/10.1007/978-3-642-59136-5_10
Polynomial closure and unambiguous product
J. -E. Pin and P. Weil Theory 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-Sadri Discrete Applied Mathematics 68 (1-2) 33 (1996) https://doi.org/10.1016/0166-218X(95)00047-U
Profinite categories, implicit operations and pseudovarieties of categories
Peter R. Jones Journal of Pure and Applied Algebra 109 (1) 61 (1996) https://doi.org/10.1016/0022-4049(95)00074-7
Robert Knast (1940–1994)
Wit Forys, Jean-Eric Pin and Denis Thérien Semigroup Forum 52 (1) 109 (1996) https://doi.org/10.1007/BF02574087
Automata, Languages and Programming
Jean-Eric Pin and Pascal Weil Lecture Notes in Computer Science, Automata, Languages and Programming 944 348 (1995) https://doi.org/10.1007/3-540-60084-1_87
Semigroups, Formal Languages and Groups
Jean-Eric Pin Semigroups, Formal Languages and Groups 1 (1995) https://doi.org/10.1007/978-94-011-0149-3_1
Equations and monoid varieties of dot-depth one and two
F. Blanchet-Sadri Theoretical Computer Science 123 (2) 239 (1994) https://doi.org/10.1016/0304-3975(92)00064-X
Automata, Languages and Programming
Imre Simon Lecture Notes in Computer Science, Automata, Languages and Programming 700 430 (1993) https://doi.org/10.1007/3-540-56939-1_92
Equations and dot-depth one
F. Blanchet-Sadri Semigroup Forum 47 (1) 305 (1993) https://doi.org/10.1007/BF02573768
Some results on the dot-depth hierarchy
Pascal Weil Semigroup Forum 46 (1) 352 (1993) https://doi.org/10.1007/BF02573578
On a conjecture concerning dot-depth two languages
H. Straubing and P. Weil Theoretical Computer Science 104 (2) 161 (1992) https://doi.org/10.1016/0304-3975(92)90121-U
Games, equations and dot-depth two monoids
F. Blanchet-Sadri Discrete Applied Mathematics 39 (2) 99 (1992) https://doi.org/10.1016/0166-218X(92)90161-3
Formal Models and Semantics
Dominique PERRIN Formal Models and Semantics 1 (1990) https://doi.org/10.1016/B978-0-444-88074-1.50006-8
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
Games, equations and the dot-depth hierarchy
F. Blanchet-Sadri Computers & Mathematics with Applications 18 (9) 809 (1989) https://doi.org/10.1016/0898-1221(89)90179-X
Inverse monoids of dot-depth two
Pascal Weil Theoretical Computer Science 66 (3) 233 (1989) https://doi.org/10.1016/0304-3975(89)90151-5
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
Catégories et langages de dot-depth un
Denis Thérien RAIRO - Theoretical Informatics and Applications 22 (4) 437 (1988) https://doi.org/10.1051/ita/1988220404371
On the equationx
t=x
t+q in categories
Denis Thérien Semigroup Forum 37 (1) 265 (1988) https://doi.org/10.1007/BF02573139
A property of the Schützenberger product
J. -E. Pin Semigroup 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 Pin Journal of Pure and Applied Algebra 41 233 (1986) https://doi.org/10.1016/0022-4049(86)90111-8
Automata, Languages and Programming
Howard Straubing Lecture Notes in Computer Science, Automata, Languages and Programming 226 416 (1986) https://doi.org/10.1007/3-540-16761-7_91
Characterizations of some classes of regular events
Jacques Stern Theoretical Computer Science 35 17 (1985) https://doi.org/10.1016/0304-3975(85)90003-9
Complexity of some problems from the theory of automata
Jacques Stern Information and Control 66 (3) 163 (1985) https://doi.org/10.1016/S0019-9958(85)80058-9
Hiérarchies de concaténation
Jean-Eric Pin RAIRO. Informatique théorique 18 (1) 23 (1984) https://doi.org/10.1051/ita/1984180100231
Some theorems on graph congruences
Robert Knast RAIRO. Informatique théorique 17 (4) 331 (1983) https://doi.org/10.1051/ita/1983170403311