A Tranlsational Theorem for the Class of EOL Languages

@article{Engelfriet1981ATT,
  title={A Tranlsational Theorem for the Class of EOL Languages},
  author={Joost Engelfriet and Grzegorz Rozenberg},
  journal={Information and Control},
  year={1981},
  volume={50},
  pages={175-183}
}
If K is not a context-free language, then sh(K, a*) is not an EOL language (where sh(Ki,Kz) denotes the shuffle of the languages K i and K2, and a is a symbol not in the alphabet of K). Hence the class of context-free languages is the largest full AFL inside the class of EOL languages. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

SALOMAA, "The Mathematical Theory of L Systems,

  • A. G. ROZENBERG
  • SIAM J. Comput
  • 1980
Highly Influential
5 Excerpts

ROZENBERG, The number of occurrences of letters versus their distribution in some EOL languages

  • G. A. EHRENFEUCHT
  • Inform. Contr
  • 1974
Highly Influential
7 Excerpts

SLUTZKI, Tree transducers, L systems and twoway machines

  • J. ENGELFRIET, G. ROZENBERG
  • J. Comput. System. Sci
  • 1980
1 Excerpt

ULLMAN, "Introduction to Automata Theory, Languages, and Computation,

  • J.D.J.E. HOPCROFT
  • 1979
1 Excerpt

EDTOL-syst6mes ultralin6aires et op6rateurs associ6s," Publication 100 du Laboratoire de Calcul

  • M. LATTEUX
  • Universit6 de Lille,
  • 1977
1 Excerpt

OPATRNY, M a c r o O L - s y s t e m s

  • II J.K. CULIK
  • Internat. J. Comput. Math
  • 1975

The number of occurrences of letters versus their distribution in some EOL languages

  • AND G. SLUTZKI
  • Inform . Contr .
  • 1974

GREIBACH, Chains of full AFLs

  • S A.
  • Math. Systems Theory
  • 1970
2 Excerpts

Similar Papers

Loading similar papers…