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.
Recommendations
Cited in
(5)- Space-efficient recognition of sparse self-reducible languages
- Reducing control alphabet size for the control of right linear grammars with unknown behaviors
- scientific article; zbMATH DE number 3843140 (Why is no real title available?)
- Moore reducibility for regular languages
- NFA reduction algorithms by means of regular inequalities
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)