Summary
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Campbell, R.H., Habermann, A.N.: The specification of process synchronization by path expressions. Lecture Notes in Computer Science, Vol. 16, pp. 89–102. Berlin-Heidelberg-New York: Springer, 1974
Minsky, M.L.: Computation: Finite and infinite machines, Englewood Cliffs, N.J.: Prentice-Hall, 1967
Ogden, W.F., Riddle, W.E., Rounds, W.C.: Complexity of expressions allowing concurrency. The Fifth Annual ACM Symposium on Principles of Programming Languages 185–194 (1978)
Shaw, A.C.: Software descriptions with flow expressions. IEEE Trans. Software Engrg., SE-4, 242–254 (1978)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Araki, T., Tokura, N. Flow languages equal recursively enumerable languages. Acta Informatica 15, 209–217 (1981). https://doi.org/10.1007/BF00289261
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00289261