Skip to main content
Conference Proceedings

Checking equality and regularity for normed BPA with silent moves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2013) 7966 LNCS(PART 2) 238-249
DOI: 10.1007/978-3-642-39212-2_23
11Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Fu, Y. (2013). Checking equality and regularity for normed BPA with silent moves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7966 LNCS, pp. 238–249). https://doi.org/10.1007/978-3-642-39212-2_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free