On the separating power of EOL systems

A. Ehrenfeucht; G. Rozenberg

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1983)

  • Volume: 17, Issue: 1, page 13-22
  • ISSN: 0988-3754

How to cite

top

Ehrenfeucht, A., and Rozenberg, G.. "On the separating power of EOL systems." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 17.1 (1983): 13-22. <http://eudml.org/doc/92174>.

@article{Ehrenfeucht1983,
author = {Ehrenfeucht, A., Rozenberg, G.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {EOL language; context-free language; pure squares; square-free words; square words},
language = {eng},
number = {1},
pages = {13-22},
publisher = {EDP-Sciences},
title = {On the separating power of EOL systems},
url = {http://eudml.org/doc/92174},
volume = {17},
year = {1983},
}

TY - JOUR
AU - Ehrenfeucht, A.
AU - Rozenberg, G.
TI - On the separating power of EOL systems
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1983
PB - EDP-Sciences
VL - 17
IS - 1
SP - 13
EP - 22
LA - eng
KW - EOL language; context-free language; pure squares; square-free words; square words
UR - http://eudml.org/doc/92174
ER -

References

top
  1. 1. J. M. AUTEBERT, J. BEAUQUIER, L. BOASSON and M. NIVAT, Quelques problèmes ouverts en théorie des langages algébrique, RAIRO Informatique Théorique, vol. 13, 1979, p. 363-379. Zbl0434.68056MR556958
  2. 2. J. BERSTEL, Sur les mots sans carré définis par un morphism, Lecture Notes in Computer Science, Springer-Verlag, vol. 71, 1979, p. 16-25. Zbl0425.20046MR573232
  3. 3. D. R. BEAN, A. EHRENFEUCHT and G. F. MCNULTY, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, vol. 85, n° 2, 1979, p. 261-294. Zbl0428.05001MR574919
  4. 4. A. EHRENFEUCHT and G. ROZENBERG, On the subword complexity of square-free DOL languages, Theoretical Computer Science, to appear. Zbl0481.68073MR632668
  5. 5. M. HARRISON, Introduction to formal language theory, Addison-Wesley, Reading, Massachusetts, 1978. Zbl0411.68058MR526397
  6. 6. J. VAN LEEUWEN, The tape complexity of context independent developmental languages, Journal of Computer and System Sciences, vol. 11, 1975, p. 203-211. Zbl0314.68017MR381397
  7. 7. G. ROZENBERG and A. SALOMAA, The mathematical theory of L System, Academic Press, London, New York, 1980. Zbl0508.68031MR561711
  8. 8. A. SALOMAA, Morphisms on free monoids and language theory, in Book, R (ed.), Formal language theory: perspectives and open problems, Academic Press, London, New York, to appear. 
  9. 9. A. SALOMAA, Jewels of formal language theory, Computer Press, Potomac, Md., to appear. Zbl0487.68063MR618124
  10. 10. A. THUE, Ueber unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I Mat.-Nat. Kl., n° 7, 1906, p. 1-22. JFM39.0283.01

NotesEmbed ?

top

You must be logged in to post comments.