Publication result detail

Descriptional Complexity of Generalized Forbidding Grammars

MEDUNA, A.; ŠVEC, M.

Original Title

Descriptional Complexity of Generalized Forbidding Grammars

English Title

Descriptional Complexity of Generalized Forbidding Grammars

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

Generalized forbidding grammars are reduced.

English abstract

Generalized forbidding grammars are reduced.

Keywords

Generalized forbidding grammars, recursively enumerable languages

Key words in English

Generalized forbidding grammars, recursively enumerable languages

Authors

MEDUNA, A.; ŠVEC, M.

Released

12.11.2003

Publisher

Taylor & Francis Informa plc

Location

London

Book

International Journal of Computer Mathematics

ISBN

0020-7160

Periodical

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

Volume

2003

Number

80

State

United Kingdom of Great Britain and Northern Ireland

Pages from

11

Pages to

17

Pages count

6

BibTex

@article{BUT41990,
  author="Alexandr {Meduna} and Martin {Švec}",
  title="Descriptional Complexity of Generalized Forbidding Grammars",
  journal="INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS",
  year="2003",
  volume="2003",
  number="80",
  pages="11--17",
  issn="0020-7160"
}