Nondeterministic Streaming String Transducers

  • Rajeev Alur
  • Jyotirmoy V. Deshmukh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6756)

Abstract

We introduce nondeterministic streaming string transducers (nssts) – a new computational model that can implement MSO-definable relations between strings. An nsst makes a single left-to-right pass on the input string and uses a finite set of string variables to compute the output. In each step, it reads one input symbol, and updates its string variables in parallel with a copyless assignment. We show that nsst are closed under sequential composition and that their expressive power coincides with that of nondeterministic MSO-definable transductions. Further, we identify the class of functionalnssts; such an nsst allows nondeterministic transitions, but for every successful run on a given input generates the same output string. We show that deciding functionality of an arbitrary nsst is decidable with pspace complexity, while the equivalence problem for functional nssts is pspace-complete. We also show that checking if the set of outputs of an nsst is contained within the set of outputs of a finite number of dssts is decidable in pspace.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Černý, P.: Expressiveness of streaming string transducers. In: Proc. of Foundations of Software Technology and Theoretical Computer Science, pp. 1–12 (2010)Google Scholar
  2. 2.
    Alur, R., Černý, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proc. of Principles of Programming Languages, pp. 599–610 (2011)Google Scholar
  3. 3.
    Černý, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., Alur, R.: Model checking of linearizability of concurrent list implementations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 465–479. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Courcelle, B.: Graph Operations, Graph Transformations and Monadic Second-Order Logic: A survey. Electronic Notes in Theoretical Computer Science 51, 122–126 (2002)CrossRefMATHGoogle Scholar
  5. 5.
    Culik, K., Karhumäki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theor. Comp. Sci. 47, 71–84 (1986)CrossRefMATHMathSciNetGoogle Scholar
  6. 6.
    Engelfriet, J., Hoogeboom, H.J.: MSO definable String Transductions and Two-way Finite-State Transducers. ACM Transactions on Computational Logic 2(2), 216–254 (2001)CrossRefMATHMathSciNetGoogle Scholar
  7. 7.
    Griffiths, T.V.: The unsolvability of the equivalence problem for ε-Free nondeterministic generalized machines. Journal of the ACM 15, 409–413 (1968)CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    Gurari, E.M., Ibarra, O.H.: The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci. 22(2), 220–229 (1981)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Gurari, E.M., Ibarra, O.H.: A Note on Finite-valued and Finitely Ambiguous Transducers. Mathematical Systems Theory 16(1), 61–66 (1983)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)CrossRefMATHGoogle Scholar
  11. 11.
    Sakarovitch, J., de Souza, R.: On the decidability of bounded valuedness for transducers. In: Proc. of Mathematical Foundations of Computer Science, pp. 588–600 (2008)Google Scholar
  12. 12.
    Schützenberger, M.P.: Sur les relations rationelles entre monoïdes libres. Theor. Comput. Sci., 243–259 (1976)Google Scholar
  13. 13.
    de Souza, R.: On the Decidability of the Equivalence for k-Valued Transducers. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol. 5257, pp. 252–263. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Weber, A.: On the Valuedness of Finite Transducers. Acta Informatica 27(8), 749–780 (1990)CrossRefMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rajeev Alur
    • 1
  • Jyotirmoy V. Deshmukh
    • 1
  1. 1.Dept. of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations