Minimizing finite automata is computationally hard
From MaRDI portal
(Redirected from Minimizing finite automata is computationally hard)
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.