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):

Towards a language theory for infinite N-free pomsets

Dietrich Kuske
Theoretical Computer Science 299 (1-3) 347 (2003)
DOI: 10.1016/S0304-3975(02)00370-5
See this article

CCS with Hennessy's merge has no finite-equational axiomatization

Luca Aceto, Wan Fokkink, Anna Ingólfsdóttir and Bas Luttik
Theoretical Computer Science 330 (3) 377 (2005)
DOI: 10.1016/j.tcs.2004.10.003
See this article

Axiomatizing the subsumption and subword preorders on finite and infinite partial words

Zoltán Ésik
Theoretical Computer Science 273 (1-2) 225 (2002)
DOI: 10.1016/S0304-3975(00)00442-4
See this article

Long words: the theory of concatenation and ω-power

Stephen L. Bloom and Christian Choffrut
Theoretical Computer Science 259 (1-2) 533 (2001)
DOI: 10.1016/S0304-3975(00)00040-2
See this article

Series-parallel languages on scattered and countable posets

Nicolas Bedon and Chloé Rispal
Theoretical Computer Science 412 (22) 2356 (2011)
DOI: 10.1016/j.tcs.2011.01.016
See this article