A Game-Theoretic Characterization of Boolean Grammars

DOI10.1007/978-3-642-02737-6_27zbMath1247.68122OpenAlexW1556758361MaRDI QIDQ3637237

Vassilis Kountouriotis, Christos Nomikos, Panos Rondogiannis

Publication date: 7 July 2009

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02737-6_27

Mathematics Subject Classification ID

Applications of game theory (91A80) Grammars and rewriting systems (68Q42)

Related Items (1)

Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages

Cites Work

• Locally stratified Boolean grammars
• Descriptive set theory
• Borel determinacy
• Boolean grammars
• An infinite-game semantics for well-founded negation in logic programming
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• Well-Founded Semantics for Boolean Grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Game-Theoretic Characterization of Boolean Grammars