1. BOASSON L. et M. NIVAT: Sur Diverses Familles de Langages Fermées par Transductions Rationnelles. Acta Informatica, 2, 180–188 (1973).
2. GINSBURG S.: The Mathematical Theory of Context-Free Languages. Mc Graw Hill (1966).
3. GREIBACH S.: Jump pda's, Deterministic Context-Free Languages, Principal AFDL's and Polynomial Time Recognition. Proc. of 5th Annual ACM Symposium on Theory of Computing, Austin, (Texas), 20–28 (1973).
4. GREIBACH S.: The Hardest Context-Free Language. Siam J. of Comput., 2, no4, 304–330 (1975).