Some results on C-varieties
RAIRO-Theor. Inf. Appl., 39 1 (2005) 239-262
Published online: 2005-03-15
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):
Substitution Principle and semidirect products
Célia Borlido and Mai GehrkeMathematical Structures in Computer Science 1 (2023)
https://doi.org/10.1017/S0960129523000294
The regular languages of wire linear AC$$^0$$
Michaël Cadilhac and Charles PapermanActa Informatica 59 (4) 321 (2022)
https://doi.org/10.1007/s00236-022-00432-2
A positive extension of Eilenberg’s variety theorem for non-regular languages
A. Cano, J. Cantero and A. Martínez-PastorApplicable Algebra in Engineering, Communication and Computing 32 (5) 553 (2021)
https://doi.org/10.1007/s00200-020-00414-2
Language and Automata Theory and Applications
Ondřej Klíma and Libor PolákLecture Notes in Computer Science, Language and Automata Theory and Applications 11417 108 (2019)
https://doi.org/10.1007/978-3-030-13435-8_8
Developments in Language Theory
Mário J. J. Branco and Jean-Éric PinLecture Notes in Computer Science, Developments in Language Theory 11088 156 (2018)
https://doi.org/10.1007/978-3-319-98654-8_13
Stone duality for languages and complexity
Mai Gehrke and Andreas KrebsACM SIGLOG News 4 (2) 29 (2017)
https://doi.org/10.1145/3090064.3090068
Mathematical Foundations of Computer Science 2015
Michaël Cadilhac, Andreas Krebs, Michael Ludwig and Charles PapermanLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2015 9234 141 (2015)
https://doi.org/10.1007/978-3-662-48057-1_11
Automata, Languages, and Programming
Manfred Kufleitner and Alexander LauserLecture Notes in Computer Science, Automata, Languages, and Programming 7392 275 (2012)
https://doi.org/10.1007/978-3-642-31585-5_27
EQUATIONAL DESCRIPTIONS OF LANGUAGES
JEAN-ÉRIC PINInternational Journal of Foundations of Computer Science 23 (06) 1227 (2012)
https://doi.org/10.1142/S0129054112400497
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 expressive power of the shuffle product
Jean Berstel, Luc Boasson, Olivier Carton, Jean-Éric Pin and Antonio RestivoInformation and Computation 208 (11) 1258 (2010)
https://doi.org/10.1016/j.ic.2010.06.002
ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES
ZOLTÁN ÉSIK and PASCAL WEILInternational Journal of Algebra and Computation 20 (02) 195 (2010)
https://doi.org/10.1142/S0218196710005595
Automata, Languages and Programming
Mário J. J. Branco and Jean-Éric PinLecture Notes in Computer Science, Automata, Languages and Programming 5556 115 (2009)
https://doi.org/10.1007/978-3-642-02930-1_10
Automata, Languages and Programming
Mai Gehrke, Serge Grigorieff and Jean-Éric PinLecture Notes in Computer Science, Automata, Languages and Programming 5126 246 (2008)
https://doi.org/10.1007/978-3-540-70583-3_21
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
VOLKER DIEKERT, PAUL GASTIN and MANFRED KUFLEITNERInternational Journal of Foundations of Computer Science 19 (03) 513 (2008)
https://doi.org/10.1142/S0129054108005802
Language and Automata Theory and Applications
Ondřej Klíma and Libor PolákLecture Notes in Computer Science, Language and Automata Theory and Applications 5196 299 (2008)
https://doi.org/10.1007/978-3-540-88282-4_28
Languages polylog-time reducible to dot-depth 1/2
Christian GlaßerJournal of Computer and System Sciences 73 (1) 36 (2007)
https://doi.org/10.1016/j.jcss.2006.09.004
LATIN 2006: Theoretical Informatics
Laura ChaubardLecture Notes in Computer Science, LATIN 2006: Theoretical Informatics 3887 274 (2006)
https://doi.org/10.1007/11682462_28
Actions, wreath products of C-varieties and concatenation product
Laura Chaubard, Jean-Éric Pin and Howard StraubingTheoretical Computer Science 356 (1-2) 73 (2006)
https://doi.org/10.1016/j.tcs.2006.01.039
211 (2006)
https://doi.org/10.1109/LICS.2006.24
Two algebraic approaches to variants of the concatenation product
Mário J.J. BrancoTheoretical Computer Science 369 (1-3) 406 (2006)
https://doi.org/10.1016/j.tcs.2006.09.017