Pumping languages Footnote^†

This research was supported in part by The Norwegian Research Council for Science and the Humanities.

References

• Aho , A. V. and Ulman , J. D. 1972 . The Theory of Parsing, Translation and Compiling , Vol. I , Englewood Cliffs, N.J : Prentice‐Hall .
   Google Scholar
• Bar-Hillel , Y. , Perles , M. and Shamir , E. 1961 . On formal properties of simple phrase structure grammars . Z. Phonetik, Sprachwiss.Kommunikationsforsch , 14 : 143 – 172 .
   Google Scholar
• Ehrenfeucht , A. and Rozenberg , G. 1975 . A pumping theorem for deterministic ETOL languages . Informatique theorique , 9 : 13 – 23 . Rev. Francaise Automat. Informat. Recherche Operationnell, Ser. Rouge
   Google Scholar
• Hopcropt , J. E. and Ullman , J. D. 1969 . Formal languages and their relations to automata , Addison‐Wesley . Reading, Mass
   Google Scholar
• Rabin , M. O. and Scott , D. 1959 . Finite automata and their decision problems . IBM J. Res , 3 : 114 – 125 .
   Web of Science ®Google Scholar
• Rozenberg , G. 1974 . “ A survey of mathematical theory of L‐systems ” . Edited by: Rozenberg , G. and Solamaa , A. Berlin : Springer-Veriag . L-systems
   Google Scholar