Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Chaubard, Laura
2006.
LATIN 2006: Theoretical Informatics.
Vol. 3887,
Issue. ,
p.
274.
Chaubard, L.
Pin, J.
and
Straubing, H.
2006.
First Order Formulas with Modular Ppredicates.
p.
211.
Chaubard, Laura
Pin, Jean-Éric
and
Straubing, Howard
2006.
Actions, wreath products of C-varieties and concatenation product.
Theoretical Computer Science,
Vol. 356,
Issue. 1-2,
p.
73.
Klíma, Ondřej
and
Polák, Libor
2008.
On varieties of meet automata.
Theoretical Computer Science,
Vol. 407,
Issue. 1-3,
p.
278.
Rhodes, John
and
Silva, Pedro V.
2008.
Turing machines and bimachines.
Theoretical Computer Science,
Vol. 400,
Issue. 1-3,
p.
182.
Selivanov, Victor L.
2009.
Hierarchies and reducibilities on regular languages related to modulo counting.
RAIRO - Theoretical Informatics and Applications,
Vol. 43,
Issue. 1,
p.
95.
STRAUBING, HOWARD
TESSON, PASCAL
and
THÉRIEN, DENIS
2010.
WEAKLY ITERATED BLOCK PRODUCTS AND APPLICATIONS TO LOGIC AND COMPLEXITY.
International Journal of Algebra and Computation,
Vol. 20,
Issue. 02,
p.
319.
ÉSIK, ZOLTÁN
and
WEIL, PASCAL
2010.
ALGEBRAIC CHARACTERIZATION OF LOGICALLY DEFINED TREE LANGUAGES.
International Journal of Algebra and Computation,
Vol. 20,
Issue. 02,
p.
195.
KUFLEITNER, MANFRED
and
LAUSER, ALEXANDER
2012.
AROUND DOT-DEPTH ONE.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 06,
p.
1323.
PIN, JEAN-ÉRIC
2012.
EQUATIONAL DESCRIPTIONS OF LANGUAGES.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 06,
p.
1227.
Klíma, Ondřej
2014.
On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract).
Electronic Proceedings in Theoretical Computer Science,
Vol. 151,
Issue. ,
p.
49.