"Equivalence of Deterministic One-Counter Automata is NL-complete"

Stanislav Böhm, Stefan Göller, Petr Jancar (2013)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics