Transductions of context-free languages into sets of sentential forms

  • Meera Blattner
Friday Morning
Part of the Lecture Notes in Computer Science book series (LNCS, volume 14)


Divide the context-free languages into equivalence classes in the following way: L1 and L2 are in the same class if there are a-transducers M and \(\bar M\)such that M(L1)=L2 and \(\bar M\)(L2)=L1. Define L1 and L2 to be structurally similar if they are in the same class. Among the results given below are: 1) if L1 and L2 are structurally similar and L1 has a structurally similar set of (right) sentential forms then so does L2, 2) if L1 and L2 are structurally similar and L1 is deterministic then L2 has a structurally similar set of right sentential forms, 3) if L1 and L2 are structurally similar and L1 is a parenthesis language then L2 has a structurally similar set of sentential forms, 4) there is a nonempty equivalence class of structurally similar languages that contains no (right) sentential forms of any grammar, 5) if an equivalence class contains any set of (right) sentential forms at all then every language in the class has a set of (right) sentential forms in that class.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cohen, R.S., K. Culik II, LR-regular grammar — an extension of LR(k) grammars, IEEE Conference Record of 12th Symposium on Switching and Automata Theory (1971), 153–165.Google Scholar
  2. 2.
    DeRemer, F.L., Simple LR(k) grammars, CACM 14 (1971), 453–460.Google Scholar
  3. 3.
    Elgot, C.C., J.E. Mezei, On relations defined by generalized finite automata, IBM J.Res. and Dev. 9 (1965), 47–68.Google Scholar
  4. 4.
    Ginsburg, S., S. Griebach, J. Hopcroft, Studies in abstract families of languages, Memoirs of the AMS 87, (1969).Google Scholar
  5. 5.
    Greibach, S.A., The unsolvability of the recognition of linear context-free languages, J.Assoc.Comp.Mach. 13 (1966), 582–587.Google Scholar
  6. 6.
    Gray, J., M. Harrison, Coverings and reduction problems for context-free grammars, J.Assoc.Comp.Mach. 19 (1972), 675–698.Google Scholar
  7. 7.
    Knuth, D., On translation of languages from left to right, Information and Control 8 (1965), 607–639.CrossRefGoogle Scholar
  8. 8.
    Lindenmayer, A., Mathematical models for cellular interaction in development I, II, J.Theoret.Biol. 18 (1968), 280–315.CrossRefGoogle Scholar
  9. 9.
    Lindenmayer, A., Development systems with interactions, their languages and grammars, J.Theoret.Biol. 30 (1971), 455–484.Google Scholar
  10. 10.
    McNaughton, R., Parenthesis grammars, J.Assoc.Comp.Mach. 14 (1967), 490–500.Google Scholar
  11. 11.
    Paz, A., A. Salomaa, Integral sequential word functions and growth equivalence of Lindenmayer systems, Information and Control 23 (1973), 313–343.CrossRefGoogle Scholar
  12. 12.
    Rozenberg, G., P.G. Doucet, On OL-languages, Information and Control 19 (1971), 302–318.CrossRefGoogle Scholar
  13. 13.
    Salomaa, A., Sentential forms of context-free grammars, Acta Informatica 2 (1974), 40–49.CrossRefGoogle Scholar
  14. 14.
    Williams, J.H., Bounded context parsable grammars, Technical Report #58, Computer Science Department, Univ. of Wisc., Madison, Wisc. (1969).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • Meera Blattner
    • 1
    • 2
  1. 1.The University of MassachusettsAmherst
  2. 2.Harvard UniversityCambridge

Personalised recommendations