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:

A fast algorithm to decide on the equivalence of stateless DPDA

Didier Caucal

RAIRO-Theor. Inf. Appl., 27 1 (1993) 23-48

Published online: 2017-02-01

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

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

Pushdown automata, multiset automata, and Petri nets

Yoram Hirshfeld and Faron Moller
Theoretical Computer Science 256 (1-2) 3 (2001)
https://doi.org/10.1016/S0304-3975(00)00099-2

Complete formal systems for equivalence problems

Géraud Sénizergues
Theoretical Computer Science 231 (2) 309 (2000)
https://doi.org/10.1016/S0304-3975(99)00106-1

A polynomial algorithm for deciding bisimilarity of normed context-free processes

Yoram Hirshfeld, Mark Jerrum and Faron Moller
Theoretical Computer Science 158 (1-2) 143 (1996)
https://doi.org/10.1016/0304-3975(95)00064-X

Term Rewriting

Géraud Sénizergues
Lecture Notes in Computer Science, Term Rewriting 909 75 (1995)
https://doi.org/10.1007/3-540-59340-3_7

Y. Hirshfeld, M. Jerrum and F. Moller
623 (1994)
https://doi.org/10.1109/SFCS.1994.365729