| dc.contributor.author | Jančar, Petr | |
| dc.date.accessioned | 2007-08-30T11:19:10Z | |
| dc.date.available | 2007-08-30T11:19:10Z | |
| dc.date.issued | 1997 | |
| dc.identifier.citation | Automata, Languages and Programming : 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997. Proceedings. 1997, p. 549-559. | en |
| dc.identifier.isbn | 978-3-540-63165-1 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/62370 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | Automata, Languages and Programming : 24th International Colloquium, ICALP '97 Bologna, Italy, July 7–11, 1997. Proceedings | en |
| dc.relation.uri | http://dx.doi.org/10.1007/3-540-63165-8 | en |
| dc.title | Bisimulation equivalence is decidable for one-counter processes | en |
| dc.type | article | en |
| dc.identifier.location | Není ve fondu ÚK | en |
| dc.description.abstract-en | It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata where the pushdown behaves like a counter, in fact. Also regularity, i.e. bisimulation equivalence with some finite-state process, is shown to be decidable for the mentioned processes. | en |
| dc.identifier.doi | 10.1007/3-540-63165-8 | |
| dc.identifier.wos | 000075412600052 | |