Abstract
Kozen (1977) proved that the emptiness problem for regular languages intersection is polynomial complete. In this paper we show that many other problems concerning deterministic finite state automata are polynomial complete and therefore intractable for solution. On the other hand, simplified versions of these problems can be solved in polynomial time by deterministic algorithms. This work is a part of the research on automata theory carried out at the Institute of Cybernetics headed by academician V.M. Glushkov.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
