Abstract

For a given ω-regular language A we establish an invariant property of the structure of finite automata which accept A.

Full Text
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

Schedule a call