| dc.contributor.author | Jančar, Petr | |
| dc.date.accessioned | 2008-11-26T08:47:28Z | |
| dc.date.available | 2008-11-26T08:47:28Z | |
| dc.date.issued | 2008 | |
| dc.identifier.citation | Developments in Language Theory : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008 : Proceedings. 2008, p. 56-71. | en |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/70129 | |
| dc.description.abstract | 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. | en |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Developments in Language Theory : 12th International Conference, DLT 2008, Kyoto, Japan, September 16-19, 2008 : Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/978-3-540-85780-8 | en |
| dc.subject | bisimulation equivalence | en |
| dc.subject | decidability | en |
| dc.title | Selected ideas used for decidability and undecidability of bisimilarity | en |
| dc.type | proceedings paper | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.identifier.doi | 10.1007/978-3-540-85780-8 | |
| dc.identifier.wos | 000260092300004 | |