Abstract
We study ω-languages accepted by finite automata whose structures are cascade products of resets. It is proved that the class of ω-languages accepted by these kinds of automata under Muller-type conditions coincides with the class of star-free ω-regular languages and that it properly includes the class of ω-languages accepted by these kinds of automata under Büch-type conditions. Furthermore we prove that the class of projective images of star-free ω-regular languages coincides with the class of ω-regular languages.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
