Equivalence of Deterministic One-Counter Automata is NL-complete Stanislav Böhm Stefan Göller

First Page		Document Content
Date: 2013-06-01 16:46:19		Equivalence of Deterministic One-Counter Automata is NL-complete Stanislav Böhm Stefan Göller Add to Reading List Source URL: www.informatik.uni-bremen.de Download Document from Source Website File Size: 407,48 KB Share Document on Facebook