Control structures and monadic languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 33)
We defined an algebraic structure on in order to give inductive descriptions of computation sets of goto and while schemes. However, the characterization of is unsatisfactory insofar as the program iteration is a partial operation: it can be applied only to certain pairs of monadic languages. But, what are the permissible pairs?
In a forthcoming paper |4|, we remove this draw-back by means of so-called vector languages. Moreover, they can be used to characterize computation sets of repeat exit schemes.
- |1|.J.A. Brzozowski: Derivatives of Regular Expressions. Journal ACM 11 (1964), 481–494Google Scholar
- |2|.J.Engelfriet: Simple Program Schemes and Formal Languages. Springer Lecture Notes in Computer Science 20 (1974)Google Scholar
- |3|.K. Indermark: On a Class of Schematic Languages. GMD-ITAS-Seminarbericht 82 (1974); to appear in: Proc. International Seminar on Languages and Programming Theory, Madrid (1975), North Holland P.C.Google Scholar
- |4|.K. Indermark: The Continuous Algebra of Monadic languages. Proc. Mathematical Foundations of Computer Science, Mariánské Lázne, Czechoslovakia (1975); to appear in: Springer Lecture Notes in Computer ScienceGoogle Scholar
- |5|.D.E. Knuth and R.W. Floyd: Notes on Avoiding goto-Statements. Information Processing Letters 1 (1971), 23–31Google Scholar
© Springer-Verlag Berlin Heidelberg 1975