Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language R with R1⊆R⊆R2 for given regular languages R1,R2

Hashiguchi, 1982, Regular languages of star height one, Inform. Control, 53, 199, 10.1016/S0019-9958(82)91028-2 K. Hashiguchi, Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language, Proc. 18th Internat. Coll. on Automata, Languages and Programming, 1991, Lecture Notes in Computer Science, Vol. 510, Springer, Berlin, 1991, pp. 641–648. Ibarra, 1973, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput., 7, 524, 10.1137/0207042