A Game-Theoretic Characterization of Boolean Grammars

DOI10.1007/978-3-642-02737-6_27MaRDI QIDQ3637237zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A game-theoretic characterization of Boolean grammars
• Boolean grammars
• scientific article; zbMATH DE number 2040923
• Well-Founded Semantics for Boolean Grammars
• Mathematical Foundations of Computer Science 2005

Cites work

• scientific article; zbMATH DE number 5605108 (Why is no real title available?)
• scientific article; zbMATH DE number 4155872 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• scientific article; zbMATH DE number 3078993 (Why is no real title available?)
• An infinite-game semantics for well-founded negation in logic programming
• Boolean grammars
• Borel determinacy
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• Descriptive set theory
• Locally stratified Boolean grammars
• Well-Founded Semantics for Boolean Grammars

Cited in

(3)

• A game-theoretic characterization of Boolean grammars
• Comparing linear conjunctive languages to subfamilies of the context-free languages
• Conjunctive and Boolean grammars: the true general case of the context-free grammars

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637237)