Skip to main content
SpringerLink
Log in

On Alternating Phrase-Structure Grammars

  • Conference paper
Book cover Language and Automata Theory and Applications (LATA 2008)

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

  • 796 Accesses

Abstract

We study several extensions of the notion of alternation from context-free grammars to context-sensitive and arbitrary phrase-structure grammars. Thereby new grammatical characterizations are obtained for the class of languages that are accepted by alternating pushdown automata.

Major parts of this work were done while Etsuro Moriya was visiting at the Fachbereich Elektrotechnik/Informatik, Universität Kassel.

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. Buntrock, G., Otto, F.: Growing context-sensitive languages and Church-Rosser languages. Information and Computation 141, 1–36 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chandra, A.K., Stockmeyer, L.J.: Alternation. In: Proc. 17th FOCS, pp. 98–108. IEEE Computer Society Press, Los Alamitos (1976)

    Google Scholar 

  3. Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery 28, 114–133 (1981)

    MATH  MathSciNet  Google Scholar 

  4. Chen, Z.Z., Toda, S.: Grammatical characterizations of P and PSPACE. IEICIE Transactions on Information and Systems E 73, 1540–1548 (1990)

    Google Scholar 

  5. Dahlhaus, E., Warmuth, M.: Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences 33, 456–472 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  6. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)

    Google Scholar 

  7. Ibarra, O.H., Jiang, T., Wang, H.: A characterization of exponential-time languages by alternating context-free grammars. Theoretical Computer Science 99, 301–313 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kasai, T.: An infinite hierarchy between context-free and context-sensitive languages. Journal of Computer and Systems Sciences 4, 492–508 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown automata. In: Proc. 19th FOCS. IEEE Computer Society Press, Los Alamitos (1978)

    Google Scholar 

  10. Ladner, R.E., Lipton, R.J., Stockmeyer, L.J.: Alternating pushdown and stack automata. SIAM Journal on Computing 13, 135–155 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  11. Mateescu, A., Salomaa, A.: Aspects of classical language theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol. 1, pp. 175–251. Springer, Berlin (1997)

    Google Scholar 

  12. Matthews, G.: A note on symmetry in phrase structure grammars. Information and Control 7, 360–365 (1964)

    Article  MATH  Google Scholar 

  13. Moriya, E.: A grammatical characterization of alternating pushdown automata. Theoretical Computer Science 67, 75–85 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  14. Moriya, E., Hofbauer, D., Huber, M., Otto, F.: On state-alternating context-free grammars. Theoretical Computer Science 337, 183–216 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  15. Moriya, E., Nakayama, S.: Grammatical characterizations of alternating pushdown automata and linear bounded automata. Gakujutsu Kenkyu, Series of Math., vol. 45, pp. 13–24. School of Education, Waseda Univ. (1997) (in Japanese)

    Google Scholar 

  16. Moriya, E., Otto, F.: Two ways of introducing alternation into context-free grammars and pushdown automata. IEICIE Transactions on Information and Systems E 90- D, 889–894 (2007)

    Article  Google Scholar 

  17. Moriya, E., Otto, F.: On alternating non-context-free gammars. Kasseler Informatik Schriften 2007, 6. Fachbereich Elektrotechnik/Informatik, Universität Kassel (2007), https://kobra.bibliothek.uni-kassel.de/handle/urn:nbn:de:hebis:34-2007110719587

  18. Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6, 519–535 (2001)

    MATH  MathSciNet  Google Scholar 

  19. Otto, F., Moriya, E.: Shrinking alternating two-pushdown automata. IEICIE Transactionns on Information and Systems E 87- D, 959–966 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Advanced Research Institute for Science and Engineering and Department of Mathematics, School of Education, Waseda University, Shinjuku-ku, Tokyo, 169-8050, Japan

    Etsuro Moriya

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Etsuro Moriya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Rovira i Virgili University, Plaza Imperial Tàrraco 1, 43005, Tarragona, Spain

    Carlos Martín-Vide

  2. Fachbereich Elektrotechnik/Informatik, Universität Kassel, Wilhelmshöher Allee 73, 34121, Kassel, Germany

    Friedrich Otto

  3. Fachbereich 4, Abteilung Informatik/Wirtschaftsinformatik, Universität Trier, Campus II, Gebäude H, 54286, Trier, Germany

    Henning Fernau

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moriya, E., Otto, F. (2008). On Alternating Phrase-Structure Grammars. In: Martín-Vide, C., Otto, F., Fernau, H. (eds) Language and Automata Theory and Applications. LATA 2008. Lecture Notes in Computer Science, vol 5196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88282-4_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88282-4_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88281-7

  • Online ISBN: 978-3-540-88282-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation