Pure grammars and pure languagesFootnote†

†This work was supported by the National Research Council of Canada, Grant No. A-1617 and was performed while the author was a postdoctoral fellow at the University of Waterloo during 1970. It first appeared as a research report [19] in October 1970. Interest in pure grammars has been rekindled recently by the appearance of [20] and a number of other still unpublished papers

References

• Arbib , M.A. 1969 . Theories of Abstract Automata , Englewood Cliffs, N.J : Prentice-Hall .
   Google Scholar
• Brzozowski , J.A. 1962 . Canonical regular expressions and minimal state graphs for definite events . Proceedings of the Symposium on Mathematical Theory of Automata . April 24, 25, 26 1962 . pp. 529 – 561 . New York : Polytechnic Institute of Brooklyn .
   Google Scholar
• Büchi , J.R. 1964 . Regular canonical systems . Arch. Math. Logik Grundlagenforsch , 6 : 91 – 111 .
   Google Scholar
• Chomsky , N. 1957 . Syntactic Structures , Gravenhage : Mouton .
   Google Scholar
• Chomsky , N. 1965 . Aspects of the Theory of Syntax , Cambridge, Mass : M.I.T. Press .
   Google Scholar
• Culik , K. II . 1970 . n-ary grammars and the description of mapping of languages . Kybernetika , 6 : 99 – 117 .
   Google Scholar
• Davis , M. 1958 . Computahility and Unsolvability , New York : McGraw-Hill .
   Google Scholar
• Elgot , C.C. and Mezei , J.E. 1965 . On relations defined by generalized finite automata . IBM J. Res. Develop , 9 : 47 – 68 .
   Web of Science ®Google Scholar
• Ginsburg , S. 1966 . The Mathematical Theory of Context-Free Languages , New York : McGraw-Hill .
   Google Scholar
• Ginsburg , S. and Rice , H.G. 1962 . Two families of languages related to ALGOL . J. Assoc for Comp. Much , 9 : 350 – 371 .
   Google Scholar
• Harris , Z.S. 1964 . String Analysis of Sentence Structure , The Hague : Mouton .
   Google Scholar
• Hopcroft , J.E. and Ullman , J.D. 1969 . Formal Languages and their Relation to Automaat , Reading, Mass : Addison-Wesley .
   Google Scholar
• Joshi , A.K. , Kosaraju , S.R. and Yamada , H. . String adjuct grammars . IEEE Conference Record of Tenth Annual Symposium on Switching and Automata Theory . Oct 15-17 1969 . pp. 245 – 262 . Waterloo
   Google Scholar
• Král , J. 1969 . On multiple grammars . Kybernetika , 5 : 60 – 85 .
   Google Scholar
• Nash , B.O. and Cohen , R.S. . Parallel leveled grammars . IEEE Conference Record of Tenth Annual Symposium on Switching and Automata Theory . Oct 15-17 1969 . pp. 263 – 276 . Waterloo
   Google Scholar
• Post , E. 1943 . Formal reductions of the general combinatorial decision problem . Amer. J. Math , 65 : 197 – 215 .
   Google Scholar
• Salomaa , A. 1969 . Theory of Automata , Oxford : Addison-Wesley .
   Google Scholar
• Wittgenstein , L. 1958 . Philosophical Investigations , Oxford : Blackwell . translated by G.E.M. Anscombe
   Google Scholar
• Gabrielian , A. Oct 1970 . Pure Grammars and Pure Languages , Oct , Univ. of Waterloo . Research Report CSRR 2027, Dept. of Applied Analysis and Computer Science
   Google Scholar
• Maurer , H.A. , Salomaa , A. and Wood , D. 1980 . Pure Grammars . Information and Control , 9 Oct : 47 – 72 .
   Google Scholar