Abstract
Let l be a family of languages effectively closed under inverse homomorphism and intersection with regular sets and such that the languages have effectively constructible semilinear Parikh maps. We show that there is an algorithm to decide given a language L in L and a language R accepted by a one-way nondeterministic multicounter machine, where each counter makes exactly one reversal, whether L∩ R is empty. This result has many applications. In particular, it can be used to show that there is an algorithm to decide given a language L in L and two-way deterministic sequential transducers (2DST's) S 1 and S 2 whether S 1 and S 2 are equivalent on L.
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.
