Abstract
We study the equivalence problem for languages defined by various types of transducers acting on D0L languages. We show that, given ϵ-free sequential transducers S 1, …, S k , T 1, …, T k and D0L languages L 1, L 2, whether or not |S 1|(L 1)∪···∪|S k |(L 1)=|T 1|(L 2)∪···∪|T k |(L 2) is decidable.
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.
