Locally stratified Boolean grammars

  • Authors:

  • Christos Nomikos;Panos Rondogiannis

  • Affiliations:

  • 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:
  • Information and Computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce locally stratified Boolean grammars, a natural subclass of Boolean grammars with many desirable properties. Informally, if a grammar is locally stratified then the set of all pairs of the form (nonterminal, string) of the grammar can be mapped to a (possibly infinite) set of strata so as that the following holds: if the membership of a string w in the language defined by nonterminal A depends on the membership of string w^' in the language defined by nonterminal B, then (B,w^') cannot belong to a stratum higher than the stratum of (A,w); furthermore, if the above dependency is obtained through negation, (B,w^') must belong to a stratum lower than the stratum of (A,w). We prove that local stratifiability can be tested in linear time with respect to the size of the given grammar. We then develop the semantics of locally stratified grammars and prove that it is independent of the choice of the stratification mapping. We argue that the class of locally stratified Boolean grammars appears at present to be the broadest subclass of Boolean grammars that can be given a classical semantics (ie., without resorting to three-valued formal language theory).