Detail publikace

Combined Leftmost Derivations in Matrix Grammars

MEDUNA, A., ŠKRKAL, O.

Originální název

Combined Leftmost Derivations in Matrix Grammars

Typ

článek ve sborníku ve WoS nebo Scopus

Jazyk

angličtina

Originální abstrakt

It is an open problem, whether matrix grammars with erasing productions using leftmost derivation of type three generate the whole family of recursively enumerable languages. This paper proves that matrix grammars that apply one matrix using leftmost derivation of type one and all other matrices using leftmost derivation of type three generate the family of recursively enumerable languages.

Klíčová slova

Formal language theory, regulated rewriting, matrix grammar, canonical derivation, generative power.

Autoři

MEDUNA, A., ŠKRKAL, O.

Rok RIV

2004

Vydáno

19. 4. 2004

Místo

Ostrava

ISBN

80-85988-99-2

Kniha

Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling

Edice

1st edition

Strany od

127

Strany do

132

Strany počet

6

BibTex

@inproceedings{BUT17119,
  author="Alexandr {Meduna} and Oto {Škrkal}",
  title="Combined Leftmost Derivations in Matrix Grammars",
  booktitle="Proceedings of 7th International Conference ISIM'04 Information Systems Implementation and Modelling",
  year="2004",
  series="1st edition",
  pages="127--132",
  address="Ostrava",
  isbn="80-85988-99-2"
}