Publication Details
Simple Matrix Grammars and Their Leftmost Variants
Soukup Ondřej, Ing., Ph.D.
simple matrix grammars, leftmost derivations, generative power
In essence, simple matrix grammars can be seen as sequences of context-free
grammars, referred to as their components, which work in parallel. The present
paper demonstrates that two-component simple matrix grammars are as powerful as
ordinary matrix grammars. Then, it places three leftmost derivation restrictions
upon these grammars and demonstrates that under two of these restrictions, simple
matrix grammars are computational complete--that is, they are equivalent with
Turing machines. From a historical perspective, concerning simple matrix
grammars, the paper also makes several remarks that correct false statements
published about them in the past.
@article{BUT130903,
author="Alexandr {Meduna} and Ondřej {Soukup}",
title="Simple Matrix Grammars and Their Leftmost Variants",
journal="International Journal of Foundations of Computer Science",
year="2016",
volume="27",
number="3",
pages="359--373",
doi="10.1142/S0129054116400141",
issn="0129-0541",
url="http://www.worldscientific.com/doi/10.1142/S0129054116400141"
}