Semi-discrete context-free languagesFootnote^†

^†This research was supported in part by the Natural Sciences and Engineering Research Council of Canada, Grant A7877

References

• Arnold , A. and Latteux , M. 1979 . A new proof of two theorems about rational transductions . Theoretical Computer Science , 8 : 261 – 263 .
   Google Scholar
• Bar-Hillel , Y. , Perles , M. and Shamir , E. 1961 . On formal properties of simple phrase structure grammars, Z. Phonetik, Sprach . Kommunikationforsch , 14 : 143 – 172 .
   Google Scholar
• Beauquier , J. 1979 . Générateurs algébriques et systémes de paires itérantes, Theoretical Computer Science , 8 : 293 – 323 .
   Google Scholar
• Berstel , J. 1973 . Une hiérarchie des parties rationnelles de N 2 . Math. Syst. Theory , 7 : 114 – 137 .
   Google Scholar
• Berstel , J. 1979 . Transductions and Context-Free Languages , Teubner-Verlag .
   Google Scholar
• Blattner , M. and Latteux , M. 1981 . “ Parikh-bounded languages, ICALP, Tel-Aviv, Juillet ” . In Lecture Notes in Computer Science , Vol. 115 , 316 – 323 . Springer-Verlag .
   Google Scholar
• Boasson , L. 1974 . “ Paires Itérantes et Languages Algébriques ” . In Thése de doctorat d’Etat , Vol. 7 , Université de Paris .
   Google Scholar
• Boasson , L. 1976 . Langages algébriques, pairs itérantes et transductions rationnelles . Theoretical Computer Science , 2 : 209 – 223 .
   Google Scholar
• Eilenberg , S. 1974 . Automata, Languages and Machines , Academic Press .
   Google Scholar
• Elgot , C.C. and Mezei , G. 1965 . On relations defined by generalized finite automata . I.B.M.J. of Res. and Dev , 9 : 47 – 65 .
   Web of Science ®Google Scholar
• Ginsburg , S. 1966 . The Mathematical Theory of Context-Free Languages , McGraw-Hill .
   Google Scholar
• Ginsburg , S. and Rovan , B. 1974 . On the periodicity of word length in DOL languages . Inform, and Control , 26 : 34 – 44 .
   Google Scholar
• Ginsburg , S. and Spanier , E.H. 1971 . AFL with the semilinear property . J. Comp. Syst. Sc. , 5 : 365 – 396 .
   Google Scholar
• Head , T. and Thierrin , G. 1980 . Hypercodes in deterministic and slender OL languages . Inform, and Control , 45 : 251 – 262 .
   Google Scholar
• Kunze , M. , Shyr , H.J. and Thierrin , G. 1982 . H-bounded and semi-discrete languages . Inform, and Control , 51 : 174 – 187 . 1981
   Google Scholar
• Lee , K.P. and Rozenberg , G. 1974 . The length sets of DOL languages are uniformly bounded . Inform. Proc. Lett , 2 : 185 – 188 .
   Google Scholar