Zobrazit minimální záznam

dc.contributor.authorForejt, Vojtěch
dc.contributor.authorJančar, Petr
dc.contributor.authorKiefer, Stefan
dc.contributor.authorWorrell, James
dc.date.accessioned2015-01-12T14:31:53Z
dc.date.available2015-01-12T14:31:53Z
dc.date.issued2014
dc.identifier.citationInformation and Computation. 2014, vol. 237, p. 1-11.cs
dc.identifier.issn0890-5401
dc.identifier.issn1090-2651
dc.identifier.urihttp://hdl.handle.net/10084/106292
dc.description.abstractWe 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.isoencs
dc.publisherElseviercs
dc.relation.ispartofseriesInformation and Computationcs
dc.relation.urihttp://dx.doi.org/10.1016/j.ic.2014.04.003cs
dc.titleLanguage equivalence of probabilistic pushdown automatacs
dc.typearticlecs
dc.identifier.doi10.1016/j.ic.2014.04.003
dc.type.statusPeer-reviewedcs
dc.description.sourceWeb of Sciencecs
dc.description.volume237cs
dc.description.lastpage11cs
dc.description.firstpage1cs
dc.identifier.wos000339468300001


Soubory tohoto záznamu

SouboryVelikostFormátZobrazit

K tomuto záznamu nejsou připojeny žádné soubory.

Tento záznam se objevuje v následujících kolekcích

Zobrazit minimální záznam