Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R₁ R R₂ for given regular languages R₁,R₂.

From MaRDI portal
Publication:1853563















This page was built for publication: Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language \(R \) with \(R_{1}\subseteq R\subseteq R_{2}\) for given regular languages \(R_{1},R_{2}\).

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