A game-theoretic characterization of Boolean grammars

Authors:
Vassilis Kountouriotis;Christos Nomikos;Panos Rondogiannis
Affiliations:
Department of Informatics & Telecommunications, University of Athens, Panepistimiopolis, 157 84 Athens, Greece;Department of Computer Science, University of Ioannina, P.O. Box 1186, 45 110 Ioannina, Greece;Department of Informatics & Telecommunications, University of Athens, Panepistimiopolis, 157 84 Athens, Greece
Venue:
Theoretical Computer Science
Year:
2011

Citing 7
Cited 0

Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Boolean grammars

Information and Computation
Minimum model semantics for logic programs with negation-as-failure

ACM Transactions on Computational Logic (TOCL)
Locally stratified Boolean grammars

Information and Computation
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

CSR '07 Proceedings of the 2nd international symposium on Computer Science in Russia: Theory and Applications
Well-founded semantics for Boolean grammars

Information and Computation
Well-Founded semantics for boolean grammars

DLT'06 Proceedings of the 10th international conference on Developments in Language Theory

Quantified Score

Hi-index	5.23

Visualization

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.