Quotient and bounded context-free languages

References

• Baker , B. S. and Book , R. V. 1974 . Reversal-bounded multipushdown machines . J. Comp. Syst. Sc. , 8 : 315 – 332 .
   Google Scholar
• Berstel , B. 1979 . Transductions and Context-Free Languages , Stuttgart : Teubner-Verlag .
   Google Scholar
• Berstel , J. and Boasson , L. 1974 . “ Une suite décroissante de cônes rationnels ” . In Automata, Languages and Programming , 383 – 397 . Saarbrüchen : Springer-Verlag . Second Colloquium
   Google Scholar
• Boasson , L. 1980 . Conjugates and CF languages . Bulletin of EATCS , 11 : 12 – 13 .
   Google Scholar
• Chomsky , N. and Schutzenberger , M. P. 1963 . “ The algebraic theory of context-free languages ” . In Computer Programming and Formal Systems , Edited by: Braffort , P. and Hirschberg , D. 118 – 161 . Amsterdam : North-Holland Publishing Company .
   Google Scholar
• Ginsburg , S. 1975 . Algebraic and Automata—Theoretic Properties of Formal Languages , Amsterdam : Norlh-Holland Publishing Company .
   Google Scholar
• Ginsburg , S. and Spanier , E. H. 1964 . Bounded-algol-like languages . Trans. American Math. Soc. , 113 : 333 – 368 .
   Web of Science ®Google Scholar
• Ginsburgh , S. and Spanier , E. H. 1966 . Bounded regular sets . Proc. American Math. Soc. , 17 : 1043 – 1049 .
   Google Scholar
• Latteux , M. , Leguy , B. and Ratoandromanana , B. 1985 . The family of one-counter languages is closed under quotient . Acta Informatica , 22 : 579 – 588 .
   Google Scholar
• Nivat , M. 1967 . Transductions de langages de Chomsky . Ann. Inst. Fourier , 18 : 339 – 455 . Grenoble
   Google Scholar