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 generic framework for checking semantic equivalences between pushdown automata and finite-state automata

Antonín Kučera and Richard Mayr
Journal of Computer and System Sciences 91 82 (2018)

CONCUR 2006 – Concurrency Theory

Clemens Grabmayer, Jan Willem Klop and Bas Luttik
Lecture Notes in Computer Science, CONCUR 2006 – Concurrency Theory 4137 16 (2006)

Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time

Antonı́n Kučera and Richard Mayr
Theoretical Computer Science 270 (1-2) 677 (2002)

Machines, Computations, and Universality

Géraud Sénizergues
Lecture Notes in Computer Science, Machines, Computations, and Universality 2055 114 (2001)

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)

Algebraic Methodology and Software Technology

Wan Fokkink
Lecture Notes in Computer Science, Algebraic Methodology and Software Technology 1101 180 (1996)