Detail výsledku

Syntactic Complexity of Scattered Context Grammars

MEDUNA, A. Syntactic Complexity of Scattered Context Grammars. ACTA INFORMATICA, 1995, vol. 1995, no. 32, p. 285-298. ISSN: 0001-5903.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Meduna Alexandr, prof. RNDr., CSc.
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

Anotace

V tonto článku je zkoumána syntaktická složitost gramatik s roztroušeným kontextem s ohledem na počet neterminálů.

Rok
1995
Strany
285–298
Časopis
ACTA INFORMATICA, roč. 1995, č. 32, ISSN 0001-5903
Kniha
Acta Informatica
Vydavatel
Springer Verlag
Místo
Berlin
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"
}
Pracoviště
Fakulta informačních technologií (FIT)
Nahoru