Detail publikačního výsledku

Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages

MEDUNA, A.

Originální název

Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages

Anglický název

Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

The present paper investigates the descriptional complexity of multi-sequential grammars with respect to the number of nonterminals.

Anglický abstrakt

The present paper investigates the descriptional complexity of multi-sequential grammars with respect to the number of nonterminals.

Klíčová slova

descriptional complexity, multi-sequential grammars, recursively enumerable languages, nonterminals

Klíčová slova v angličtině

descriptional complexity, multi-sequential grammars, recursively enumerable languages, nonterminals

Autoři

MEDUNA, A.

Vydáno

01.01.1997

Nakladatel

unknown

Místo

London

Kniha

International Journal of Computer Mathematics

ISSN

0020-7160

Periodikum

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

Svazek

1997

Číslo

65

Stát

Spojené království Velké Británie a Severního Irska

Strany od

179

Strany do

189

Strany počet

11

BibTex

@article{BUT191801,
  author="Alexandr {Meduna}",
  title="Six-Nonterminal Multi-Sequential Grammars Characterize the Family of Recursively Enumerable Languages",
  journal="INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS",
  year="1997",
  volume="1997",
  number="65",
  pages="179--189",
  issn="0020-7160"
}