Regular languages of star height one

https://doi.org/10.1016/S0019-9958(82)91028-2Get rights and content
Under an Elsevier user license
open archive

There exists an algorithm for deciding whether or not an arbitrary regular language is of star height one.

Cited by (0)