Regular languages definable by Lindström quantifiers
RAIRO-Theor. Inf. Appl., 37 3 (2003) 179-241
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):
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
AROUND DOT-DEPTH ONE
MANFRED KUFLEITNER and ALEXANDER LAUSERInternational Journal of Foundations of Computer Science 23 (06) 1323 (2012)
https://doi.org/10.1142/S0129054112400552
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
WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY
HOWARD STRAUBING, PASCAL TESSON and DENIS THÉRIENInternational Journal of Algebra and Computation 20 (02) 319 (2010)
https://doi.org/10.1142/S0218196710005686
Hierarchies and reducibilities on regular languages related to modulo counting
Victor L. SelivanovRAIRO - Theoretical Informatics and Applications 43 (1) 95 (2009)
https://doi.org/10.1051/ita:2007063
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
Turing machines and bimachines
John Rhodes and Pedro V. SilvaTheoretical Computer Science 400 (1-3) 182 (2008)
https://doi.org/10.1016/j.tcs.2008.03.019
LATIN 2006: Theoretical Informatics
Laura ChaubardLecture Notes in Computer Science, LATIN 2006: Theoretical Informatics 3887 274 (2006)
https://doi.org/10.1007/11682462_28
211 (2006)
https://doi.org/10.1109/LICS.2006.24
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