Detail publikace

The Leftmost Derivation of Type Two in Matrix Grammars

ŠKRKAL, O.

Originální název

The Leftmost Derivation of Type Two in Matrix Grammars

Anglický název

The Leftmost Derivation of Type Two in Matrix Grammars

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Dokumenty

BibTex 


@inproceedings{BUT13993,
  author="Oto {Škrkal}",
  title="The Leftmost Derivation of Type Two in Matrix Grammars",
  annote="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.",
  booktitle="Proceedings of 6th International Conference ISIM'03 Information System Implementation and Modeling",
  chapter="13993",
  year="2003",
  month="april",
  pages="195--199",
  type="conference paper"
}