scientific article; zbMATH DE number 3907802

From MaRDI portal
Publication:3685229





[For the entire collection see Zbl 0555.00003.] The idea of alphabetic reduction is introduced. With regard to the set \({\mathcal L}(N)\) of all regular languages, represented by finite automata with N states, the complexity of recognizing a bounded alphabetic reduction is estimated.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3685229)