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

Research output: Contribution to journalArticle

3 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

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the power of cooperation: a regular representation of recursively enumerable languages'. Together they form a unique fingerprint.

  • Cite this