Detail výsledku

A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars

MEDUNA, A. A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars. Bulletin of the European Association for Theoretical Computer Science, 1995, vol. 1995, no. 56, p. 1-3. ISSN: 0252-9742.
Typ
článek v časopise
Jazyk
anglicky
Autoři
Meduna Alexandr, prof. RNDr., CSc.
Abstrakt

The family of the recursively enumerable languages is characterized by scattered context grammars by using an extremely simple method.

Klíčová slova

recursively enumerable languages, scattered context grammars

Anotace

Třídu rekurzivně spočetných jazyků lze charakterizovat gramatikami s roztroušeným kontextem. Tato metoda je prezentována v článku.

Rok
1995
Strany
1–3
Časopis
Bulletin of the European Association for Theoretical Computer Science, roč. 1995, č. 56, ISSN 0252-9742
Kniha
EATCS Bulletin
Vydavatel
Springer Verlag
Místo
Leiden
BibTeX 
@article{BUT191805,
  author="Alexandr {Meduna}",
  title="A Trivial Method of Characterizing the Family of Recursively Enumerable Languages by Scattered Context Grammars",
  journal="Bulletin of the European Association for Theoretical Computer Science",
  year="1995",
  volume="1995",
  number="56",
  pages="1--3",
  issn="0252-9742"
}
Pracoviště
Fakulta informačních technologií (FIT)
Nahoru