Detail publikace

One-Sided Forbidding Grammars and Selective Substitution Grammars

Originální název

One-Sided Forbidding Grammars and Selective Substitution Grammars

Anglický název

One-Sided Forbidding Grammars and Selective Substitution Grammars

Jazyk

en

Originální abstrakt

In one-sided forbidding grammars, the set of rules is divided into the set of left forbidding rules and the set of right forbidding rules. A left forbidding rule can rewrite a nonterminal if each of its forbidding symbols is absent to the left of the rewritten symbol in the current sentential form while a right forbidding rule is applied analogically except that this absence is verified to the right. Apart from this, they work like ordinary forbidding grammars. As its main result, the present paper proves that one-sided forbidding grammars are equivalent to selective substitution grammars. This equivalence is established in terms of grammars with and without erasing rules. Furthermore, the paper proves that one-sided forbidding grammars in which the set of left forbidding rules coincides with the set of right forbidding rules characterize the family of context-free languages. In the conclusion, the significance of the achieved results is discussed.

Anglický abstrakt

In one-sided forbidding grammars, the set of rules is divided into the set of left forbidding rules and the set of right forbidding rules. A left forbidding rule can rewrite a nonterminal if each of its forbidding symbols is absent to the left of the rewritten symbol in the current sentential form while a right forbidding rule is applied analogically except that this absence is verified to the right. Apart from this, they work like ordinary forbidding grammars. As its main result, the present paper proves that one-sided forbidding grammars are equivalent to selective substitution grammars. This equivalence is established in terms of grammars with and without erasing rules. Furthermore, the paper proves that one-sided forbidding grammars in which the set of left forbidding rules coincides with the set of right forbidding rules characterize the family of context-free languages. In the conclusion, the significance of the achieved results is discussed.

BibTex


@article{BUT91446,
  author="Alexandr {Meduna} and Petr {Zemek}",
  title="One-Sided Forbidding Grammars and Selective Substitution Grammars",
  annote="In one-sided forbidding grammars, the set of rules is divided into the set of
left forbidding rules and the set of right forbidding rules. A left forbidding
rule can rewrite a nonterminal if each of its forbidding symbols is absent to the
left of the rewritten symbol in the current sentential form while a right
forbidding rule is applied analogically except that this absence is verified to
the right. Apart from this, they work like ordinary forbidding grammars.

As its main result, the present paper proves that one-sided forbidding grammars
are equivalent to selective substitution grammars. This equivalence is
established in terms of grammars with and without erasing rules. Furthermore, the
paper proves that one-sided forbidding grammars in which the set of left
forbidding rules coincides with the set of right forbidding rules characterize
the family of context-free languages. In the conclusion, the significance of the
achieved results is discussed.",
  address="NEUVEDEN",
  chapter="91446",
  doi="10.1080/00207160.2011.642300",
  edition="NEUVEDEN",
  howpublished="print",
  institution="NEUVEDEN",
  number="5",
  volume="89",
  year="2012",
  month="march",
  pages="586--596",
  publisher="NEUVEDEN",
  type="journal article in Web of Science"
}