Show simple item record

dc.contributor.authorJančar, Petr
dc.date.accessioned2006-11-09T11:58:12Z
dc.date.available2006-11-09T11:58:12Z
dc.date.issued2000
dc.identifier.citationInformation and computation. 2000, vol. 158, issue 1, p. 1-17 .en
dc.identifier.issn0890-5401
dc.identifier.urihttp://hdl.handle.net/10084/58004
dc.language.isoenen
dc.publisherAcademic Pressen
dc.relation.ispartofseriesInformation and computationen
dc.relation.urihttp://dx.doi.org/10.1006/inco.1999.2813en
dc.subjectequivalenceen
dc.titleDecidability of bisimilarity for one-counter processesen
dc.typearticleen
dc.identifier.locationNení ve fondu ÚKen
dc.description.abstract-enIt is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata, where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes.en
dc.identifier.doi10.1006/inco.1999.2813
dc.identifier.wos000086495000001


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record