Publication result detail

Syntactic Complexity of Scattered Context Grammars

MEDUNA, A.

Original Title

Syntactic Complexity of Scattered Context Grammars

English Title

Syntactic Complexity of Scattered Context Grammars

Type

Peer-reviewed article not indexed in WoS or Scopus

Original Abstract

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.

English abstract

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.

Keywords

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

Key words in English

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

Authors

MEDUNA, A.

Released

01.01.1995

Publisher

Springer Verlag

Location

Berlin

Book

Acta Informatica

ISBN

0001-5903

Periodical

ACTA INFORMATICA

Volume

1995

Number

32

State

Federal Republic of Germany

Pages from

285

Pages to

298

Pages count

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"
}