Skip to main content
SpringerLink
Log in

A Game-Theoretic Characterization of Boolean Grammars

  • Conference paper
Developments in Language Theory (DLT 2009)

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

Included in the following conference series:

Abstract

We obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Information and Computation, 194 (2004) 19-48]. In particular, we propose a two-player infinite game of perfect information for Boolean grammars, which is equivalent to their well-founded semantics. The game is directly applicable to the simpler classes of conjunctive and context-free grammars, and it offers a promising new connection between game theory and formal languages.

This work is supported by the 03EΔ 330 research project, implemented within the framework of the “Reinforcement Programme of Human Research Manpower” (ΠENEΔ) and co-financed by National and Community Funds (75% from E.U.-European Social Fund and 25% from the Greek Ministry of Development-General Secretariat of Research and Technology and from the private sector).

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. Galanaki, C., Rondogiannis, P., Wadge, W.: An Infinite-Game Semantics for Well-Founded Negation in Logic Programming. Annals of Pure and Applied Logic 151(2–3), 70–88 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gale, D., Stewart, F.M.: Infinite Games with Perfect Information. Annals of Mathematical Studies 28, 245–266 (1953)

    MathSciNet  MATH  Google Scholar 

  3. Kountouriotis, V., Nomikos, C., Rondogiannis, P.: Well-founded semantics for boolean grammars. In: H. Ibarra, O., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 203–214. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Martin, D.A.: Borel Determinacy. Annals of Mathematics 102, 363–371 (1975)

    Google Scholar 

  5. Moschovakis, Y.N.: Descriptive Set Theory. North-Holland, Amsterdam (1980)

    MATH  Google Scholar 

  6. Nomikos, C., Rondogiannis, P.: Locally Stratified Boolean Grammars. Information and Computation 206(9-10), 1219–1233 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Okhotin, A.: Conjunctive Grammars. Journal of Automata, Languages and Combinatorics 6(4), 519–535 (2001)

    MathSciNet  MATH  Google Scholar 

  8. Okhotin, A.: Boolean Grammars. Information and Computation 194(1), 19–48 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Okhotin, A.: Nine open problems on conjunctive and Boolean grammars. TUCS Technical Report No 794, Turku Centre for Computer Science, Turku, Finland (November 2006)

    Google Scholar 

  10. Jeż, A., Okhotin, A.: Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds.) CSR 2007. LNCS, vol. 4649, pp. 168–181. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. Przymusinska, H., Przymusinski, T.: Semantic Issues in Deductive Databases and Logic Programs. In: Banerji, R. (ed.) Formal Techniques in Artificial Intelligence: a Source-Book, pp. 321–367. North-Holland, Amsterdam (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics & Telecommunications, University of Athens, Athens, Greece

    Vassilis Kountouriotis & Panos Rondogiannis

  2. Department of Computer Science, University of Ioannina, P.O. Box 1186, 45 110, Ioannina, Greece

    Christos Nomikos

Authors
  1. Vassilis Kountouriotis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos Nomikos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos Rondogiannis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Formale Methoden der Informatik, FMI, Universität Stuttgart, Universitätsstrasse 38, 70569, Stuttgart, Germany

    Volker Diekert  & Dirk Nowotka  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kountouriotis, V., Nomikos, C., Rondogiannis, P. (2009). A Game-Theoretic Characterization of Boolean Grammars. In: Diekert, V., Nowotka, D. (eds) Developments in Language Theory. DLT 2009. Lecture Notes in Computer Science, vol 5583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02737-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02737-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02736-9

  • Online ISBN: 978-3-642-02737-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation