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:

On Shuffle Ideals

Pierre-Cyrille Héam

RAIRO-Theor. Inf. Appl., 36 4 (2002) 359-384

Published online: 2003-02-15

DOI: https://doi.org/10.1051/ita:2003002

This article has been cited by the following article(s):

State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages

Stefan Hoffmann
Information and Computation 301 105204 (2024)
https://doi.org/10.1016/j.ic.2024.105204

Stefan Hoffmann
13037 64 (2021)
https://doi.org/10.1007/978-3-030-93489-7_6

Stefan Hoffmann
13037 51 (2021)
https://doi.org/10.1007/978-3-030-93489-7_5

On shuffle products, acyclic automata and piecewise-testable languages

S. Halfon and Ph. Schnoebelen
Information Processing Letters 145 68 (2019)
https://doi.org/10.1016/j.ipl.2019.01.012

On the state complexity of closures and interiors of regular languages with subwords and superwords

P. Karandikar, M. Niewerth and Ph. Schnoebelen
Theoretical Computer Science 610 91 (2016)
https://doi.org/10.1016/j.tcs.2015.09.028

Descriptional Complexity of Formal Systems

Prateek Karandikar and Philippe Schnoebelen
Lecture Notes in Computer Science, Descriptional Complexity of Formal Systems 8614 234 (2014)
https://doi.org/10.1007/978-3-319-09704-6_21

Diagrammatic Representation and Inference

Aidan Delaney, John Taylor and Simon Thompson
Lecture Notes in Computer Science, Diagrammatic Representation and Inference 5223 172 (2008)
https://doi.org/10.1007/978-3-540-87730-1_18