Richard Mayr. On the Complexity of Bisimulation Problems for Pushdown Automata. In Jan van Leeuwen, Osamu Watanabe, Masami Hagiya, Peter D. Mosses, Takayasu Ito, editors, Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings. Volume 1872 of Lecture Notes in Computer Science, pages 474-488, Springer, 2000. [doi]
@inproceedings{Mayr00a,
title = {On the Complexity of Bisimulation Problems for Pushdown Automata},
author = {Richard Mayr},
year = {2000},
url = {http://link.springer.de/link/service/series/0558/bibs/1872/18720474.htm},
researchr = {https://researchr.org/publication/Mayr00a},
cites = {0},
citedby = {0},
pages = {474-488},
booktitle = {Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference IFIP TCS 2000, Sendai, Japan, August 17-19, 2000, Proceedings},
editor = {Jan van Leeuwen and Osamu Watanabe and Masami Hagiya and Peter D. Mosses and Takayasu Ito},
volume = {1872},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-67823-9},
}