Publication detail

Simple Matrix Grammars and Their Leftmost Variants

MEDUNA, A. SOUKUP, O.

Original Title

Simple Matrix Grammars and Their Leftmost Variants

Type

journal article in Web of Science

Language

English

Original Abstract

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.

Keywords

simple matrix grammars, leftmost derivations, generative power

Authors

MEDUNA, A.; SOUKUP, O.

Released

8. 6. 2016

ISBN

0129-0541

Periodical

International Journal of Foundations of Computer Science

Year of study

27

Number

3

State

Republic of Singapore

Pages from

359

Pages to

373

Pages count

15

URL

http://www.worldscientific.com/doi/10.1142/S0129054116400141

BibTex

@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"
}