On the power of cooperation: a regular representation of recursively enumerable languages

E. Csuhaj-Varjú, Jozef Kelemen

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

We show that each recursively enumerable language can be generated by two cooperating conditional regular grammars, where the condition of the application of a production is checking of the occurrence of a word of length at most two in the current sentential form.

Original languageEnglish
Pages (from-to)305-310
Number of pages6
JournalTheoretical Computer Science
Volume81
Issue number2
DOIs
Publication statusPublished - Apr 30 1991

Fingerprint

Recursively Enumerable Languages
Grammar
Form

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

On the power of cooperation : a regular representation of recursively enumerable languages. / Csuhaj-Varjú, E.; Kelemen, Jozef.

In: Theoretical Computer Science, Vol. 81, No. 2, 30.04.1991, p. 305-310.

Research output: Contribution to journalArticle

@article{7e99da11b4594e15999524a6e3c6a38b,
title = "On the power of cooperation: a regular representation of recursively enumerable languages",
abstract = "We show that each recursively enumerable language can be generated by two cooperating conditional regular grammars, where the condition of the application of a production is checking of the occurrence of a word of length at most two in the current sentential form.",
author = "E. Csuhaj-Varj{\'u} and Jozef Kelemen",
year = "1991",
month = "4",
day = "30",
doi = "10.1016/0304-3975(91)90198-B",
language = "English",
volume = "81",
pages = "305--310",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - On the power of cooperation

T2 - a regular representation of recursively enumerable languages

AU - Csuhaj-Varjú, E.

AU - Kelemen, Jozef

PY - 1991/4/30

Y1 - 1991/4/30

N2 - We show that each recursively enumerable language can be generated by two cooperating conditional regular grammars, where the condition of the application of a production is checking of the occurrence of a word of length at most two in the current sentential form.

AB - We show that each recursively enumerable language can be generated by two cooperating conditional regular grammars, where the condition of the application of a production is checking of the occurrence of a word of length at most two in the current sentential form.

UR - http://www.scopus.com/inward/record.url?scp=0026137896&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026137896&partnerID=8YFLogxK

U2 - 10.1016/0304-3975(91)90198-B

DO - 10.1016/0304-3975(91)90198-B

M3 - Article

AN - SCOPUS:0026137896

VL - 81

SP - 305

EP - 310

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 2

ER -