Abstract
The length-degree of a normalized finite transducer (NFT) M is the minimal nonnegative d such that each input word of M only has values with at most d different lengths — or is infinite, depending on whether or not such a d exists. Using the notion of the length-degree, we present some basic results on the lengths of values in a finite transducer. The strongest of these results is: A generalized sequential machine (GSM) with finite length-degree can be effectively decomposed into finitely many GSM's M1,...,MN with length-degree one such that the relation realized by M is the union of the relations realized by M1,...,MN. Using this decomposition, we demonstrate that the equivalence of GSM's with finite length-degree is decidable. By reduction, both results can be easily generalized to NFT's.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart, 1979.
M. Blattner and T. Head, Single-valued a-transducers, JCSS, 15(1977), pp. 310–327.
K. Culik II, New techniques for proving the decidability of equivalence problems, Proc. 15th ICALP, in: LNCS, No. 317, Springer-Verlag, Berlin, Heidelberg, 1988, pp. 162–175.
K. Culik II and J. Karhumäki, The equivalence of finite valued transducers (on HDTOL languages) is decidable, TCS, 47(1986), pp. 71–84.
T. Griffiths, The unsolvability of the equivalence problem for ∧-free nondeterministic generalized machines, JACM, 15(1968), pp. 409–413.
E. Gurari and O. Ibarra, The complexity of decision problems for finite-turn multi-counter machines, JCSS, 22(1981), pp. 220–229.
E. Gurari and O. Ibarra, A note on finite-valued and finitely ambiguous transducers, Math. Systems Theory, 16(1983), pp. 61–66.
J. Hopcroft and J. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
O. Ibarra, The unsolvability of the equivalence problem for ε-free NGSM's with unary input (output) alphabet and applications, SIAM J. Comput., 7(1978), pp. 524–532.
J. Karhumäki, The equivalence of mappings on languages, Proc. 4th IMYCS, in: LNCS, No. 281, Springer-Verlag, Berlin, Heidelberg, 1987, pp. 26–38.
J. Karhumäki, On recent trends in formal language theory, Proc. 14th ICALP, in: LNCS, No. 267, Springer-Verlag, Berlin, Heidelberg, 1987, pp. 136–162.
M. Schützenberger, Sur les relations rationnelles entre monoïdes libres, TCS, 3(1976), pp. 243–259.
A. Weber, Über die Mehrdeutigkeit und Wertigkeit von endlichen Automaten und Transducern, Dissertation, Goethe-Universität Frankfurt am Main, 1987.
A. Weber, A decomposition theorem for finite-valued transducers and an application to the equivalence problem, Proc. MFCS 1988, in: LNCS, No. 324, Springer-Verlag, Berlin, Heidelberg, 1988, pp. 552–562.
A. Weber, On the valuedness of finite transducers, Preprint, Goethe-Universität Frankfurt am Main, 1988.
A. Weber, A decomposition theorem for finite-valued transducers and an application to the equivalence problem, Preprint, Goethe-Universität Frankfurt am Main, 1988.
A. Weber, On the lengths of values in a finite transducer, Preprint, Goethe-Universität Frankfurt am Main, 1989.
A. Weber and H. Seidel, On the degree of ambiguity of finite automata, Proc. MFCS 1986, in: LNCS, No. 233, Springer-Verlag, Berlin, Heidelberg, 1986, pp. 620–629.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weber, A. (1989). On the lengths of values in a finite transducer. In: Kreczmar, A., Mirkowska, G. (eds) Mathematical Foundations of Computer Science 1989. MFCS 1989. Lecture Notes in Computer Science, vol 379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51486-4_98
Download citation
DOI: https://doi.org/10.1007/3-540-51486-4_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51486-2
Online ISBN: 978-3-540-48176-8
eBook Packages: Springer Book Archive