Bibliographic Details
| Title: |
A game-theoretic characterization of Boolean grammars |
| Authors: |
Kountouriotis, Vassilis1 bk@di.uoa.gr, Nomikos, Christos2 cnomikos@cs.uoi.gr, Rondogiannis, Panos1 prondo@di.uoa.gr |
| Source: |
Theoretical Computer Science. Mar2011, Vol. 412 Issue 12-14, p1169-1183. 15p. |
| Subjects: |
Game theory, Formal languages, Semantics, Computer science, Grammar, Linguistic context |
| Abstract: |
Abstract: We obtain a simple, purely game-theoretic characterization of Boolean grammars [A. Okhotin, Boolean grammars, Information and Computation, 194(1) (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 offers a promising new connection between game theory and formal languages. [Copyright &y& Elsevier] |
|
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
