Result Details
Rule-Homogeneous CD Grammar Systems
Křivka Zbyněk, Ing., Ph.D., DIFS (FIT)
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
A homogeneous rule has its left-hand side formed by a string of identical symbols. Consider two-component CD grammar systems that work under the * mode or the t mode. This study presents two transformations that turn arbitrary grammars into equivalent two-component CD grammar systems with a context-free component and a homogeneous component. From one transformation, the homogeneous component results with two rules of the form 11 -> 00 and 0000 -> 2222, while the other transformation produces the homogeneous component with two rules of the form 11 -> 00 and 0000 -> eps. Apart from this significant restriction of non-context-free rules, the study describes several other useful properties concerning these systems and the way they work.
CD grammar systems, simulated non-context-free rules
@misc{BUT168561,
author="Radim {Kocman} and Zbyněk {Křivka} and Alexandr {Meduna}",
title="Rule-Homogeneous CD Grammar Systems",
booktitle="AFL 2017",
year="2017",
pages="3",
address="Debrecen",
url="https://www.fit.vut.cz/research/publication/11442/",
note="Abstract"
}
Nástroje, metody a technologie ICT pro podporu konceptu smart cities, BUT, Vnitřní projekty VUT, FIT-S-17-3964, start: 2017-03-01, end: 2020-02-29, completed
V3C - Visual Computing Competence Center, TAČR, Centra kompetence, TE01020415, start: 2012-05-01, end: 2019-12-31, completed