Skip to main content
SpringerLink
Log in

1-Bounded TWA Cannot Be Determinized

  • Conference paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2914))

Abstract

Tree-walking automata are a natural sequential model for recognizing tree languages which is closely connected to XML. Two long standing conjectures say TWA cannot recognize all regular languages and that deterministic TWA are weaker than nondeterministic TWA. We consider a weaker model, 1-TWA, of tree walking automata that can make only one pass through a tree. We show that deterministic 1-TWA are weaker than 1-TWA. We also show a very simple language not recognized by 1-TWA.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Information and Control 19, 439–475 (1971)

    Article  MathSciNet  Google Scholar 

  2. Brügemann-Klein, A., Wood, D.: Caterpillars: a context specification technique. Markup Languages 2(1), 81–106 (2000)

    Article  Google Scholar 

  3. Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52–71. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  4. Engelfriet, J., Hoogeboom, H.J.: Tree-walking pebble automata. In: Paum, G., Karhumaki, J., Maurer, H., Rozenberg, G. (eds.) Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pp. 72–83. Springer, Heidelberg (1999)

    Google Scholar 

  5. Engelfriet, J., Hoogeboom, H.J., van Best, J.-P.: Trips on trees. Acta Cybernetica 14, 51–64 (1999)

    MATH  MathSciNet  Google Scholar 

  6. Kamimura, T., Slutzki, G.: Parallel two-way automata on directed ordered acyclic graphs. Information and Control 49(1), 10–51 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  7. Milo, T., Suciu, D., Vianu, V.: Type-checking for XML transformers. In: Proceedgins of the Nineteenth ACM Symposium on Principles of Database Systems, pp. 11–22 (2000)

    Google Scholar 

  8. Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Neven, F., Schwentick, T.: On the power of tree-walking automata. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, p. 547. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University,  

    Mikołaj Bojañczyk

Authors
  1. Mikołaj Bojañczyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Tata Institute of Fundamental Research, India

    Paritosh K. Pandya

  2. Tata Institute of Fundamental Research, School of Technology and Computer Science, Mumbai, India

    Jaikumar Radhakrishnan

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bojañczyk, M. (2003). 1-Bounded TWA Cannot Be Determinized. In: Pandya, P.K., Radhakrishnan, J. (eds) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2003. Lecture Notes in Computer Science, vol 2914. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24597-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24597-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20680-4

  • Online ISBN: 978-3-540-24597-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation