| dc.contributor.author | Jančar, Petr | |
| dc.contributor.author | Moller, Faron | |
| dc.contributor.author | Sawa, Zdeněk | |
| dc.date.accessioned | 2007-08-14T08:35:05Z | |
| dc.date.available | 2007-08-14T08:35:05Z | |
| dc.date.issued | 1999 | |
| dc.identifier.citation | SOFSEM 1999 : theory and practice of informatics : 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27-December 4, 1999. Proceedings. 1999, p. 404-413. | en |
| dc.identifier.isbn | 3-540-66694-X | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.uri | http://hdl.handle.net/10084/61817 | |
| dc.language.iso | en | en |
| dc.publisher | Springer | en |
| dc.relation.ispartofseries | SOFSEM 1999 : theory and practice of informatics : 26th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 27-December 4, 1999. Proceedings | en |
| dc.relation.uri | https://link.springer.com/chapter/10.1007/3-540-47849-3_28 | en |
| dc.title | Simulation problems for one-counter machines | en |
| dc.type | article | en |
| dc.identifier.location | Ve fondu ÚK | en |
| dc.description.abstract-en | We consider decidability questions for simulation preorder (and equivalence) for processes generated by one-counter machines. We sketch a proof of decidability in the case when testing for zero is not possible, and demonstrate the undecidability in the general case. | en |
| dc.identifier.wos | 000088669000028 | |