Publication Details
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.
Czech title
Jednoduchá metoda charakterizace třídy rekurzivně spočetných jazyků gramatikami s roztroušeným kontextem
Type
journal article
Language
English
Authors
Keywords
recursively enumerable languages, scattered context grammars
Abstract
The family of the recursively enumerable languages is characterized by scattered context grammars by using an extremely simple method.
Annotation
The family of the recursively enumerable languages is characterized by scattered context grammars by using an extremely simple method.
Published
1995
Pages
1–3
Journal
Bulletin of the European Association for Theoretical Computer Science, vol. 1995, no. 56, ISSN 0252-9742
Book
EATCS Bulletin
Publisher
Springer Verlag
Place
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"
}