Advertisement

Mathematical systems theory

, Volume 18, Issue 1, pp 207–235 | Cite as

A combinatorial property of EOL languages

  • A. Ehrenfeucht
  • G. Rozenberg
  • R. Verraedt
Article
  • 26 Downloads

Abstract

Let Δ be an alphabet and II its nontrivial binary partition. Each word over Δ can uniquely be decomposed in subwords (called blocks) consisting of letters of II i only,i ∈ {1,2}. LetK\( \subseteq\) Δ*.K has a long block property (with respect to II), abbreviated asLB-property, if there exists a functionf:N+N+ such that for everywK and every positive integerm the number of blocks of length at mostm inw is bounded byf(m). K has a clustered block property (with respect to II), abbreviated asCB-property, if there exists a positive integerno and a growing functiong:N+N+ such that for everywK and for every positive integerm the blocks of length at mostm can be covered by at mostno segments of length at mostg(m).

It is proved that aCB-property always implies aLB-property but not necessarily other way around. It is proved that an EOL language has aLB-property if and only if it has aCB-property.

Keywords

Computational Mathematic Combinatorial Property Block Property Binary Partition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Ehrenfeucht and G. Rozenberg, The number of occurrences of letters versus their distribution in some EOL languages,Inform. and Control 26 (1975), 256–271.Google Scholar
  2. 2.
    J. Engelfriet and G. Rozenberg, A translational theorem for the class of EOL languages,Inform. and Control 50 (1981), 175–183.Google Scholar
  3. 3.
    H. C. M. Kleijn and G. Rozenberg, Context-free like restrictions on selective rewriting, University of Leiden, Technical report 80–19.Google Scholar
  4. 4.
    H. C. M. Kleijn and G. Rozenberg, On the generative power of regular pattern grammars,Acta Information 20 (1983), 391–411.Google Scholar
  5. 5.
    G. Rozenberg and A. Salomaa,The Mathematical Theory of L Systems, 1980, Academic Press, New York.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1985

Authors and Affiliations

  • A. Ehrenfeucht
    • 1
  • G. Rozenberg
    • 2
  • R. Verraedt
    • 3
  1. 1.Department of Computer ScienceUniversity of ColoradoBoulderUSA
  2. 2.Institute of Applied Mathematics and Computer ScienceUniversity of LeidenThe Netherlands
  3. 3.Technical UniversityGroup TBelgium

Personalised recommendations