|
|||||
|
|
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes |
|
| Authors: | Antonín Ku?era Richard Mayr |
| Affiliation: | 1. Faculty of Informatics, Masaryk University, Botanická 68a, 60200 Brno, Czech Republic;2. School of Informatics, LFCS, University of Edinburgh, 10 Crichton Street, Edinburgh EH8 9AB, UK |
| Abstract: | |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |