Information and ControlVolume 53, Issue 3, June 1982, Pages 199-210Information and Cont...Regular languages of star height oneAuthor links open overlay panelK. HashiguchiShow moreShareCitehttps://doi.org/10.1016/S0019-9958(82)91028-2Get rights and contentUnder an Elsevier user licenseopen archiveThere exists an algorithm for deciding whether or not an arbitrary regular language is of star height one.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1982 Published by Elsevier Inc.