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:

Efficiency of automata in semi-commutation verification techniques

Gérard Cécé, Pierre-Cyrille Héam, Yann Mainier

RAIRO-Theor. Inf. Appl., 42 2 (2008) 197-215

Published online: 2007-09-25

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

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

Stefan Hoffmann
14519 311 (2024)
https://doi.org/10.1007/978-3-031-52113-3_22

State Complexity of Permutation and the Language Inclusion Problem up to Parikh Equivalence on Alphabetical Pattern Constraints and Partially Ordered NFAs

Stefan Hoffmann
International Journal of Foundations of Computer Science 34 (08) 959 (2023)
https://doi.org/10.1142/S0129054123430025

Implementation and Application of Automata

Stefan Hoffmann
Lecture Notes in Computer Science, Implementation and Application of Automata 12803 53 (2021)
https://doi.org/10.1007/978-3-030-79121-6_5

Regular languages and partial commutations

Antonio Cano, Giovanna Guaiana and Jean-Éric Pin
Information and Computation 230 76 (2013)
https://doi.org/10.1016/j.ic.2013.07.003

Fair Synthesis for Asynchronous Distributed Systems

Paul Gastin and Nathalie Sznajder
ACM Transactions on Computational Logic 14 (2) 1 (2013)
https://doi.org/10.1145/2480759.2480761

A note on partially ordered tree automata

P.-C. Héam
Information Processing Letters 108 (4) 242 (2008)
https://doi.org/10.1016/j.ipl.2008.05.012

Automata, Languages and Programming

Antonio Cano Gómez, Giovanna Guaiana and Jean-Éric Pin
Lecture Notes in Computer Science, Automata, Languages and Programming 5126 209 (2008)
https://doi.org/10.1007/978-3-540-70583-3_18