| dc.contributor.author | Forejt, Vojtěch | |
| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Kiefer, Stefan | |
| dc.contributor.author | Worrell, James | |
| dc.date.accessioned | 2015-01-12T14:31:53Z | |
| dc.date.available | 2015-01-12T14:31:53Z | |
| dc.date.issued | 2014 | |
| dc.identifier.citation | Information and Computation. 2014, vol. 237, p. 1-11. | cs |
| dc.identifier.issn | 0890-5401 | |
| dc.identifier.issn | 1090-2651 | |
| dc.identifier.uri | http://hdl.handle.net/10084/106292 | |
| dc.description.abstract | We study the language equivalence problem for probabilistic pushdown automata (pPDA) and their subclasses. We show that the problem is interreducible with the multiplicity equivalence problem for context-free grammars, the decidability of which has been open for several decades. Interreducibility also holds for pPDA with one control state.
In contrast, for the case of a one-letter input alphabet we show that pPDA language equivalence (and hence multiplicity equivalence of context-free grammars) is in PSPACE and at least as hard as the polynomial identity testing problem. | cs |
| dc.language.iso | en | cs |
| dc.publisher | Elsevier | cs |
| dc.relation.ispartofseries | Information and Computation | cs |
| dc.relation.uri | http://dx.doi.org/10.1016/j.ic.2014.04.003 | cs |
| dc.title | Language equivalence of probabilistic pushdown automata | cs |
| dc.type | article | cs |
| dc.identifier.doi | 10.1016/j.ic.2014.04.003 | |
| dc.type.status | Peer-reviewed | cs |
| dc.description.source | Web of Science | cs |
| dc.description.volume | 237 | cs |
| dc.description.lastpage | 11 | cs |
| dc.description.firstpage | 1 | cs |
| dc.identifier.wos | 000339468300001 | |