Abstract
Symbolic finite transducers are extensions of classical finite transducers. A transition of a symbolic finite transducer represents a (possibly infinite) set of transitions of a classical one. This setting allows symbolic finite transducers to succinctly recognize transductions. A transducer is k-valued if the maximal number of different outputs for an input string is bounded by k and it is finite-valued if it is k-valued for some k. In this paper, we study the valuedness problem for symbolic finite transducers. We show that for symbolic finite transducers over decidable labels, the k-valuedness problem is decidable. For finite transducers, Weber introduced two criteria to characterize infinite-valuedness, both of which can be easily transformed into properties for symbolic finite transducers. Although these two criteria are sufficient conditions for infinite-valuedness, they are not necessary conditions however. As a result, a third criterion is introduced in order to completely characterize the infinite-valuedness of symbolic finite transducers.
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.
