Publication detail

The Leftmost Derivation of Type Two in Matrix Grammars

ŠKRKAL, O.

Original Title

The Leftmost Derivation of Type Two in Matrix Grammars

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

This contribution discusses the descriptional complexity of matrix grammars using left-most derivation of type two with respect to the number of nonterminals and matrices with two or more productions. It proves that these matrix grammars need only nine nonterminals and six matrices of length two or more to generate recursively enumerable languages.

Keywords

Formal language theory, regulated rewriting, matrix grammars, canonical derivations, complexity reduction.

Authors

ŠKRKAL, O.

RIV year

2004

Released

28. 4. 2003

Location

Ostrava

ISBN

80-85988-84-4

Book

Proceedings of 6th International Conference ISIM'03 Information System Implementation and Modeling

Pages from

195

Pages to

199

Pages count

5

BibTex

@inproceedings{BUT13993,
  author="Oto {Škrkal}",
  title="The Leftmost Derivation of Type Two in Matrix Grammars",
  booktitle="Proceedings of 6th International Conference ISIM'03 Information System Implementation and Modeling",
  year="2003",
  pages="195--199",
  address="Ostrava",
  isbn="80-85988-84-4"
}