Abstract

Algorithms that run in time bounded by polynomials of low degree are given for deciding five code related properties. These algorithms apply to rational languages presented by means of non-deterministic finite automata. The algorithms avoid the construction of equivalent unambiguous automata. Instead they involve the construction of non-deterministic finite transducers. In each case the property being decided holds if and only if the associated transducer is single-valued.

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.