@article{Valiant1975340,
Abstract = {The equivalence problem for deterministic one-counter automata is shown to bedecidable. A corollary for schema theory is that equivalence is decidable for Ianov schemas with an auxiliary counter.},
Author = {Valiant, Leslie G. and Paterson, Michael S.},
File = {Deterministic one-counter automata - Valiant, Paterson (0) (0) - a - a - y.pdf},
ISSN = {0022-0000},
Journal = {Journal of Computer and System Sciences},
Number = {3},
Pages = {340 - 350},
Title = {Deterministic one-counter automata},
URL = {http://www.sciencedirect.com/science/article/pii/S0022000075800055},
Volume = {10},
Year = {1975},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0022000075800055},
bdsk-url-2 = {http://dx.doi.org/10.1016/S0022-0000(75)80005-5},
date-added = {2015-05-21 10:22:20 +0000},
date-modified = {2015-05-21 10:22:20 +0000},
doi = {10.1016/S0022-0000(75)80005-5}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A