Detail publikačního výsledku

Syntactic Complexity of Scattered Context Grammars

MEDUNA, A.

Originální název

Syntactic Complexity of Scattered Context Grammars

Anglický název

Syntactic Complexity of Scattered Context Grammars

Druh

Článek recenzovaný mimo WoS a Scopus

Originální abstrakt

The syntactic complexity of scattered context grammars with respect to the number of nonterminals is investigated. First, the family of the recursively enumerable languages is characterized by some basic operations, such as quotient and coding, over the languages generated by propagating scattered context grammars with four nonterminals.

Anglický abstrakt

The syntactic complexity of scattered context grammars with respect to the number of nonterminals is investigated. First, the family of the recursively enumerable languages is characterized by some basic operations, such as quotient and coding, over the languages generated by propagating scattered context grammars with four nonterminals.

Klíčová slova

syntactic complexity, scattered context grammars, number of nonterminals, recursively enumerable languages,operations

Klíčová slova v angličtině

syntactic complexity, scattered context grammars, number of nonterminals, recursively enumerable languages,operations

Autoři

MEDUNA, A.

Vydáno

01.01.1995

Nakladatel

Springer Verlag

Místo

Berlin

Kniha

Acta Informatica

ISSN

0001-5903

Periodikum

ACTA INFORMATICA

Svazek

1995

Číslo

32

Stát

Spolková republika Německo

Strany od

285

Strany do

298

Strany počet

14

BibTex

@article{BUT191806,
  author="Alexandr {Meduna}",
  title="Syntactic Complexity of Scattered Context Grammars",
  journal="ACTA INFORMATICA",
  year="1995",
  volume="1995",
  number="32",
  pages="285--298",
  issn="0001-5903"
}