Complexity of deciding bisimilarity between normed BPA and normed BPP

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F10%3A86075745" target="_blank" >RIV/61989100:27240/10:86075745 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Complexity of deciding bisimilarity between normed BPA and normed BPP

Original language description

We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n^7). This improves the previously known exponential upper bound. We first suggest an O(n^3) transformation of the BPPprocess into "prime form". Our algorithm then relies on a polynomial bound for a "finite-state core" of the transition system generated by the (transformed) BPP process.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

IN - Informatics

OECD FORD branch

—

Project

<a href="/en/project/1M0567" target="_blank" >1M0567: Centre for Applied Cybernetics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2010

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Information and Computation

ISSN

0890-5401

e-ISSN

—

Volume of the periodical

208

Issue of the periodical within the volume

10

Country of publishing house

US - UNITED STATES

Number of pages

13

Pages from-to

—

UT code for WoS article

000281830300006

EID of the result in the Scopus database

—