Flow languages equal recursively enumerable languages

descriptionPublicationkeyboard_double_arrow_right Article 01 Jun 1981 English Publisher:Springer Science and Business Media LLCJournal:Acta Informatica, volume 15, pages 209-217 (issn: 0001-5903, eissn: 1432-0525,

Copyright policy )

Authors: Toshiro Araki; Nobuki Tokura;

doi: 10.1007/bf00289261

Flow languages equal recursively enumerable languages

- Summary
- Subjects
- Metrics

Abstract

Recently, A.C. Shaw introduced a new class of expressions called flow expressions, and conjectured that the formal descriptive power of flow expressions lies somewhat below context-sensitive grammers. In this paper, we give a negative answer for his conjecture, that is, we show that all recursively enumerable languages may be denoted by flow expressions.

Related Organizations

Osaka University
Japan

Keywords

flow expressions, Formal languages and automata

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	14
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average