Abstract

We address the classic problem of polynomial computation of a minimal finite-state representation compatible with two finite input sets that contain those strings that have to be accepted and rejected. We extend the previously defined uniformly-complete sample and prove that it is a special case of the sufficient condition we propose.

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

Disclaimer: 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.