On Normal Forms and Erasing Rules in Path-Controlled Grammars

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU111905" target="_blank" >RIV/00216305:26230/14:PU111905 - isvavai.cz</a>
Result on the web
<a href="http://www.ejournals.eu/Schedae-Informaticae/Volume-22/art/2848/" target="_blank" >http://www.ejournals.eu/Schedae-Informaticae/Volume-22/art/2848/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4467/20838476SI.13.001.2086" target="_blank" >10.4467/20838476SI.13.001.2086</a>

Result language
angličtina
Original language name
On Normal Forms and Erasing Rules in Path-Controlled Grammars
Original language description
This paper discusses path controlled grammars-context-free grammars with a root-to-leaf path in their derivation trees restricted by a control language. First, it investigates the impact of erasing rules on the generative power of path controlled grammars. Then, it establishes two Chomsky-like normal forms for path controlled grammars-the first allows unit rules, the second allows just one erasing rule.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/ED1.1.00%2F02.0070" target="_blank" >ED1.1.00/02.0070: IT4Innovations Centre of Excellence</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)