Publication result detail

Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism

KOPEČEK, T.; MEDUNA, A.

Original Title

Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism

English Title

Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

This paper discusses some conditional versions of matrix grammars. Itestablishes several characterizations of the family of the recursivelyenumerable languages based on these grammars. In fact, making use ofthe Geffert Normal forms, the present paper demonstrates thesecharacterizations based on matrix grammars with conditions of a limitedlength, a reduced number of nonterminals, and a reduced number and sizeof matrices.

English abstract

This paper discusses some conditional versions of matrix grammars. Itestablishes several characterizations of the family of the recursivelyenumerable languages based on these grammars. In fact, making use ofthe Geffert Normal forms, the present paper demonstrates thesecharacterizations based on matrix grammars with conditions of a limitedlength, a reduced number of nonterminals, and a reduced number and sizeof matrices.

Keywords

descriptional complexity, matrix grammars, simple-semi-conditional grammars

Key words in English

descriptional complexity, matrix grammars, simple-semi-conditional grammars

Authors

KOPEČEK, T.; MEDUNA, A.

Released

19.10.2004

ISBN

1335-9150

Periodical

COMPUTING AND INFORMATICS

Volume

2004

Number

23

State

Slovak Republic

Pages from

287

Pages to

302

Pages count

16

BibTex

@article{BUT45745,
  author="Tomáš {Kopeček} and Alexandr {Meduna}",
  title="Simple-Semi-Conditional Versions of Matrix Grammars with a Reduced Regulating Mechanism",
  journal="COMPUTING AND INFORMATICS",
  year="2004",
  volume="2004",
  number="23",
  pages="287--302",
  issn="1335-9150"
}