Equational description of pseudovarieties of homomorphisms
RAIRO-Theor. Inf. Appl., 37 3 (2003) 243-254
Published online: 2003-11-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):
Syntactic structures of regular languages
Ondřej Klíma and Libor PolákTheoretical Computer Science 800 125 (2019)
https://doi.org/10.1016/j.tcs.2019.10.020
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
Stone duality for languages and complexity
Mai Gehrke and Andreas KrebsACM SIGLOG News 4 (2) 29 (2017)
https://doi.org/10.1145/3090064.3090068
Stone duality, topological algebra, and recognition
Mai GehrkeJournal of Pure and Applied Algebra 220 (7) 2711 (2016)
https://doi.org/10.1016/j.jpaa.2015.12.007
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
Ondřej KlímaElectronic Proceedings in Theoretical Computer Science 151 49 (2014)
https://doi.org/10.4204/EPTCS.151.3
EQUATIONAL DESCRIPTIONS OF LANGUAGES
JEAN-ÉRIC PINInternational Journal of Foundations of Computer Science 23 (06) 1227 (2012)
https://doi.org/10.1142/S0129054112400497
ON PSEUDOVARIETIES OF MONOUNARY ALGEBRAS
Danica Jakubíková-StudenovskáAsian-European Journal of Mathematics 05 (01) 1250003 (2012)
https://doi.org/10.1142/S1793557112500039
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
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
LITERALLY IDEMPOTENT LANGUAGES AND THEIR VARIETIES — TWO LETTER CASE
ONDŘEJ KLÍMA and LIBOR POLÁKInternational Journal of Foundations of Computer Science 21 (05) 761 (2010)
https://doi.org/10.1142/S0129054110007544
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
On Varieties of Literally Idempotent Languages
Ondřej Klíma and Libor PolákRAIRO - Theoretical Informatics and Applications 42 (3) 583 (2008)
https://doi.org/10.1051/ita:2008020
On varieties of meet automata
Ondřej Klíma and Libor PolákTheoretical Computer Science 407 (1-3) 278 (2008)
https://doi.org/10.1016/j.tcs.2008.06.005
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
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
LATIN 2006: Theoretical Informatics
Laura ChaubardLecture Notes in Computer Science, LATIN 2006: Theoretical Informatics 3887 274 (2006)
https://doi.org/10.1007/11682462_28
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
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
Some results onC-varieties
Jean-Éric Pin and Howard StraubingRAIRO - Theoretical Informatics and Applications 39 (1) 239 (2005)
https://doi.org/10.1051/ita:2005014
Mathematical Foundations of Computer Science 2004
Libor PolákLecture Notes in Computer Science, Mathematical Foundations of Computer Science 2004 3153 635 (2004)
https://doi.org/10.1007/978-3-540-28629-5_49