Equivalence of deterministic one-counter automata is NL-complete
From MaRDI portal
(Redirected from Equivalence of deterministic one-counter automata is NL-complete)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.