Left Random Context ET0L Grammars

  • Authors:

  • Alexander Meduna;Petr Zemek

  • Affiliations:

  • Faculty of Information Technology, Brno University of Technology, Bož/etě/chova 1/2, Brno 612 66, Czech Republic. meduna@fit.vutbr.cz/ izemek@fit.vutbr.cz;Faculty of Information Technology, Brno University of Technology, Bož/etě/chova 1/2, Brno 612 66, Czech Republic. meduna@fit.vutbr.cz/ izemek@fit.vutbr.cz

  • Venue:
  • Fundamenta Informaticae
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider ET0L grammars. Modify them such that a set of permitting symbols and a set of forbidding symbols are attached to each of their rules, just like in random context grammars. A rule like this can rewrite a symbol if each of its permitting symbols occurs to the left of the symbol to be rewritten in the current sentential form while each of its forbidding symbols does not occur there. ET0L grammars modified in this way are referred to as left random context ET0L grammars, and they represent the principal subject of the investigation in this paper. We prove that these grammars characterize the family of recursively enumerable languages, and without erasing rules, they characterize the family of context-sensitive languages. We also introduce a variety of special cases of these grammars and establish their generative power. In the conclusion, we put all the achieved results into the context of formal language theory as a whole and formulate several open questions.