General CD Grammar Systems and Their Simplification
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F20%3APU135359" target="_blank" >RIV/00216305:26230/20:PU135359 - isvavai.cz</a>
Result on the web
<a href="https://www.fit.vut.cz/research/publication/11509/" target="_blank" >https://www.fit.vut.cz/research/publication/11509/</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.25596/jalc-2020-037" target="_blank" >10.25596/jalc-2020-037</a>
Alternative languages
Result language
angličtina
Original language name
General CD Grammar Systems and Their Simplification
Original language description
The present paper studies general CD grammar systems, whose components are general grammars, so they are computationally complete, and it investigates them working under the * mode and t mode. Most importantly, the paper presents two types of transformations that turn arbitrary general grammars into equivalent two-component general CD grammar systems with a context-free component and a non-context-free component. From the first type of transformations, the non-context-free component results with two rules of the form 11->00 and 0000->epsilon, while the other type of transformations produces the non-context-free component with two rules of the form 11->00 and 0000->2222. Apart from this significant reduction and simplification, the paper describes several other useful properties concerning these systems and the way they work. A formulation of several remarks and open problems closes this paper.
Czech name
—
Czech description
—
Classification
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)
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)
Others
Publication year
2020
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
Journal of Automata, Languages and Combinatorics
ISSN
1430-189X
e-ISSN
—
Volume of the periodical
25
Issue of the periodical within the volume
1
Country of publishing house
DE - GERMANY
Number of pages
18
Pages from-to
37-54
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85085293890