Abstract
We investigate finite transducers and their inner structure with regard to the lengths of values. Our transducer models are the normalized finite transducer (NFT) and the nondeterministic generalized sequential machine (NGSM), which is a real-time NFT. The length-degree of an NFT is defined to be the maximal number of different lengths of values for an input word or is infinite, depending on whether or not a maximum exists. We show: An NGSMM with finite length-degree can be effectively decomposed into finitely many NGSMsM1, ...,MN having length-degree at most 1 such that the transduction realized byM is the union of the transductions realized byM1, ...,MN. Using this decomposition, the equivalence of NGSMs with finite length-degree is recursively decidable. Whether or not an NGSM has finite length-degree can be decided in deterministic polynomial time. By reduction, all these results can be generalized to NFTs.
Sign-in/Register to access full text options 
Free) 
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
