Abstract
There exists an algorithm for deciding whether or not an arbitrary regular language is of star height one.
Full Text
Sign-in/Register to access full text options
Published version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have