Detail publikace

The Left-Most Derivation of Type Two in Matrix Grammars

Originální název

The Left-Most Derivation of Type Two in Matrix Grammars

Anglický název

The Left-Most 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.

BibTex 


@inproceedings{BUT13992,
  author="Oto {Škrkal}",
  title="The Left-Most 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.",
  address="Faculty of Electrical Engineering and Communication BUT",
  booktitle="Proceedings of 9th Conference and Competition Student EEICT 2003",
  chapter="13992",
  institution="Faculty of Electrical Engineering and Communication BUT",
  year="2003",
  month="april",
  pages="566--570",
  publisher="Faculty of Electrical Engineering and Communication BUT",
  type="conference paper"
}