Locally stratified Boolean grammars

DOI10.1016/J.IC.2008.03.022MaRDI QIDQ948094zbMATH OpenOpenAlexFDO

Authors Christos Nomikos, Panos Rondogiannis

Publication date 8 October 2008

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2008.03.022

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Mathematical Foundations of Computer Science 2005
• Boolean grammars
• Well-Founded Semantics for Boolean Grammars
• Well-founded semantics for Boolean grammars
• scientific article; zbMATH DE number 2040923

Cites work

• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• 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 708664 (Why is no real title available?)
• scientific article; zbMATH DE number 1747449 (Why is no real title available?)
• scientific article; zbMATH DE number 2155200 (Why is no real title available?)
• Boolean grammars
• Conjunctive Grammars Can Generate Non-regular Unary Languages
• Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
• Mathematical Foundations of Computer Science 2005
• Minimum model semantics for logic programs with negation-as-failure
• Stratified negation in temporal logic programming and the cycle-sum test
• Temporal stratification tests for linear and branching-time deductive databases
• The well-founded semantics for general logic programs
• Unrestricted complementation in language equations over a one-letter alphabet
• Well-Founded Semantics for Boolean Grammars

Cited in

(5)

• A game-theoretic characterization of Boolean grammars
• Mathematical Foundations of Computer Science 2005
• Well-founded semantics for Boolean grammars
• Conjunctive and Boolean grammars: the true general case of the context-free grammars
• A Game-Theoretic Characterization of Boolean Grammars

This page was built for publication: Locally stratified Boolean grammars

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