On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
From MaRDI portal
(Redirected from On the classification of Post automaton bases according to the decidability of the completeness and A-completeness problems)
On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
On the classification of Post automaton bases according to the decidability of the completeness and \(A\)-completeness problems
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.
