All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

One-Sided Forbidding Grammars and Selective Substitution Grammars

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F12%3APU98154" target="_blank" >RIV/00216305:26230/12:PU98154 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.tandfonline.com/doi/abs/10.1080/00207160.2011.642300" target="_blank" >http://www.tandfonline.com/doi/abs/10.1080/00207160.2011.642300</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1080/00207160.2011.642300" target="_blank" >10.1080/00207160.2011.642300</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    One-Sided Forbidding Grammars and Selective Substitution Grammars

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2012

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    International Journal of Computer Mathematics

  • ISSN

    0020-7160

  • e-ISSN

  • Volume of the periodical

    89

  • Issue of the periodical within the volume

    5

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    11

  • Pages from-to

    586-596

  • UT code for WoS article

    000300852300001

  • EID of the result in the Scopus database