Skip to main content
SpringerLink
Log in

Deterministic Stack Transducers

  • Conference paper
  • First Online:
Implementation and Application of Automata (CIAA 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9705))

Included in the following conference series:

Abstract

We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, whereas in non-digging mode, the stack transducer is only allowed to emit symbols when its stack head is at the top of the stack. These stack transducers have a motivation from natural language interface applications, as they capture long-distance dependencies in syntactic, semantic, and discourse structures. We study the computational capacity for deterministic digging and non-digging stack transducers, as well as for their non-erasing and checking versions. We finally show that even for the strongest variant of stack transducers the stack languages are regular.

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 EPUB and 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

Notes

  1. 1.

    The term ‘digging’ refers to the intuition of digging up soil from a deep hole.

References

  1. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I: Parsing. Prentice-Hall, Upper Saddle River (1972)

    Google Scholar 

  2. Bojanczyk, M.: Transducers with origin information. In: Invited Talk at the 3rd International Workshop on Trends in Tree Automata and Tree Transducers, The Queen Mary University of London (2015)

    Google Scholar 

  3. Braune, F., Seemann, N., Quernheim, D., Maletti, A.: Shallow local multi-bottom-up tree transducers in statistical machine translation. In: Association for Computational Linguistics (ACL 2013), vol. 1, pp. 811–821. The Association for Computer Linguistics (2013)

    Google Scholar 

  4. Drewes, F., van der Merwe, B.: Path languages of random permitting context tree grammars are regular. Fundam. Inform. 82, 47–60 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Ginsburg, S., Greibach, S.A., Harrison, M.A.: Stack automata and compiling. J. ACM 14, 172–201 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ginsburg, S., Greibach, S.A., Harrison, M.A.: One-way stack automata. J. ACM 14, 389–418 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hibbard, T.N.: A generalization of context-free determinism. Inform. Control 11, 196–238 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: Sets accepted by one-way stack automata are context sensitive. Inform. Control 13, 114–133 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  9. Hori, C., Ohtake, K., Misu, T., Kashioka, H., Nakamura, S.: Weighted finite state transducer based statistical dialog management. In: Automatic Speech Recognition and Understanding (ASRU 2009), pp. 490–495. IEEE (2009)

    Google Scholar 

  10. Kutrib, M., Wendlandt, M.: On simulation cost of unary limited automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 153–164. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  11. Kutrib, M., Wendlandt, M.: Reversible limited automata. In: Durand-Lose, J., Nagy, B. (eds.) MCU 2015. LNCS, vol. 9288, pp. 113–128. Springer, Switzerland (2015)

    Chapter  Google Scholar 

  12. Mohri, M., Pereira, F.C.N., Riley, M.: Speech recognition with weighted finite-state transducers. In: Benesty, J., Sondhi, M.M., Huang, Y. (eds.) Handbook on Speech Processing and Speech Communication, Part E: Speech Recognition, pp. 559–584. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Petrov, S.: Towards Universal Syntactic and Semantic Processing of Natural Language. Invited talk at SLTC 2016, Uppsala University (2014)

    Google Scholar 

  14. Pighizzini, G., Pisoni, A.: Limited automata and regular languages. Int. J. Found. Comput. Sci. 25, 897–916 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  15. Pighizzini, G., Pisoni, A.: Limited automata and context-free languages. Fundamenta Inform. 136, 157–176 (2015)

    MathSciNet  MATH  Google Scholar 

  16. Wagner, K., Wechsung, G.: Computational Complexity. Reidel, Dordrecht (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, 90187, Umeå, Sweden

    Suna Bensch & Johanna Björklund

  2. Institut für Informatik, Universität Giessen, Arndtstr. 2, 35392, Giessen, Germany

    Martin Kutrib

Authors
  1. Suna Bensch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Johanna Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Kutrib
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Martin Kutrib .

Editor information

Editors and Affiliations

  1. Yonsei University, Seoul, Korea (Republic of)

    Yo-Sub Han

  2. Queen's University , Kingston, Ontario, Canada

    Kai Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Bensch, S., Björklund, J., Kutrib, M. (2016). Deterministic Stack Transducers. In: Han, YS., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2016. Lecture Notes in Computer Science(), vol 9705. Springer, Cham. https://doi.org/10.1007/978-3-319-40946-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40946-7_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40945-0

  • Online ISBN: 978-3-319-40946-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation