Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Polák, Libor
2004.
Mathematical Foundations of Computer Science 2004.
Vol. 3153,
Issue. ,
p.
635.
Pin, Jean-Éric
and
Straubing, Howard
2005.
Some results onC-varieties.
RAIRO - Theoretical Informatics and Applications,
Vol. 39,
Issue. 1,
p.
239.
Branco, Mário J.J.
2006.
Two algebraic approaches to variants of the concatenation product.
Theoretical Computer Science,
Vol. 369,
Issue. 1-3,
p.
406.
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.
Language and Automata Theory and Applications.
Vol. 5196,
Issue. ,
p.
299.
DIEKERT, VOLKER
GASTIN, PAUL
and
KUFLEITNER, MANFRED
2008.
A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS.
International Journal of Foundations of Computer Science,
Vol. 19,
Issue. 03,
p.
513.
Klíma, Ondřej
and
Polák, Libor
2008.
On Varieties of Literally Idempotent Languages.
RAIRO - Theoretical Informatics and Applications,
Vol. 42,
Issue. 3,
p.
583.
Klíma, Ondřej
and
Polák, Libor
2008.
On varieties of meet automata.
Theoretical Computer Science,
Vol. 407,
Issue. 1-3,
p.
278.
Gehrke, Mai
Grigorieff, Serge
and
Pin, Jean-Éric
2008.
Automata, Languages and Programming.
Vol. 5126,
Issue. ,
p.
246.
KLÍMA, ONDŘEJ
and
POLÁK, LIBOR
2010.
LITERALLY IDEMPOTENT LANGUAGES AND THEIR VARIETIES — TWO LETTER CASE.
International Journal of Foundations of Computer Science,
Vol. 21,
Issue. 05,
p.
761.
Berstel, Jean
Boasson, Luc
Carton, Olivier
Pin, Jean-Éric
and
Restivo, Antonio
2010.
The expressive power of the shuffle product.
Information and Computation,
Vol. 208,
Issue. 11,
p.
1258.
Kufleitner, Manfred
and
Lauser, Alexander
2012.
Automata, Languages, and Programming.
Vol. 7392,
Issue. ,
p.
275.
PIN, JEAN-ÉRIC
2012.
EQUATIONAL DESCRIPTIONS OF LANGUAGES.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 06,
p.
1227.
Jakubíková-Studenovská, Danica
2012.
ON PSEUDOVARIETIES OF MONOUNARY ALGEBRAS.
Asian-European Journal of Mathematics,
Vol. 05,
Issue. 01,
p.
1250003.
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.
Gehrke, Mai
2016.
Stone duality, topological algebra, and recognition.
Journal of Pure and Applied Algebra,
Vol. 220,
Issue. 7,
p.
2711.
Gehrke, Mai
and
Krebs, Andreas
2017.
Stone duality for languages and complexity.
ACM SIGLOG News,
Vol. 4,
Issue. 2,
p.
29.
Klíma, Ondřej
and
Polák, Libor
2019.
Language and Automata Theory and Applications.
Vol. 11417,
Issue. ,
p.
108.