On Subword Complexities of Homomorphic Images of Languages

@article{Ehrenfeucht1982OnSC,
  title={On Subword Complexities of Homomorphic Images of Languages},
  author={Andrzej Ehrenfeucht and Grzegorz Rozenberg},
  journal={ITA},
  year={1982},
  volume={16},
  pages={303-316}
}
— The subword complexity of a language K is the function nK on positive integer s such that nK (n) equals the number of different subwords of length n appearing in words of X. We investigate the relationship between nk(K) and nK where Kis a language and h is a homorphism. This study is aiso carried out for the special case when Kis a DOL language. Resumé. — La complexité des facteurs d'un langage K est la fonction nK définie sur les entiers positifs telle que nK (n) est le nombre de facteurs… CONTINUE READING

From This Paper

Topics from this paper.
10 Citations
4 References
Similar Papers

References

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

and A

  • G. ROZENBER
  • SALOMAA, The Mathematical Theory of L Systems…
  • 1980
1 Excerpt

Subwords of Deveîopmental Languages, Ph

  • LEE K.P.
  • D. Thesis, State University of New York at…
  • 1975

for Sets of Subwords in Deterministic TOL Systems, Information Processing Letters, Vol

  • A. EHRENFEUCHT, G. ROZENBERG, A Limit Theore
  • 2,
  • 1973

Similar Papers

Loading similar papers…