The paper tries to highlight some crucial ideas appearing in the decidability and undecidability proofs for the bisimilarity problem on models originating in language theory, like context-free grammars and pushdown automata. In particular, it focuses on the method of finite bases of bisimulations in the case of decidability and the method of "Defender's forcing" in the case of undecidability. An intent was to write an easy-to-read article in a slightly informal way, which should nevertheless convey the basic ideas with sufficient precision. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Jančar, P. (2008). Selected ideas used for decidability and undecidability of bisimilarity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 56–71). https://doi.org/10.1007/978-3-540-85780-8_4
Mendeley helps you to discover research relevant for your work.