Testing Whether a Binary and Prolongeable Regular Language L Is Geometrical or Not on the Minimal Deterministic Automaton of Pref(L)
From MaRDI portal
WARNING: Page is not linked to a MaRDI-Entity. Please add Sitelink / Wikibase-link.