The Number of Occurrences of Letters Versus Their Distribution in Some E0L Languages

Department of Mathematics, Utrecht University, Utrecht-Uithof, The Netherlands
Information and Control 11/1974; 26(3):256-271. DOI: 10.1016/S0019-9958(74)91379-5
Source: DBLP


A characterization theorem is given for a class of developmental languages. The theorem binds together the number of occurrences of letters in the words of the given language with the distribution of these letters.

Download full-text


Available from: Grzegorz Rozenberg, Sep 07, 2015
0 Reads
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper provides a method of “decomposing” a subclass of ET0L languages into deterministic ET0L languages. This allows one to use every known example of a language which is not a deterministic ET0L language to produce languages which are not ET0L languages.
    Theoretical Computer Science 04/1976; 1(4):325-330. DOI:10.1016/0304-3975(76)90076-1 · 0.66 Impact Factor
  • Source
    Theoretical Computer Science 12/1977; 5(3):339-354. DOI:10.1016/0304-3975(77)90050-0 · 0.66 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we study systematically three basic classes of grammars incorporating parallel rewriting: Indian parallel grammars, Russian parallel grammars and L systems. In particular by extracting basic characteristics of these systems and combining them we introduce new classes of rewriting systems (ETOL[k] systems, ETOLIP systems and ETOLRP systems) Among others, some results on the combinatorial structure of Indian parallel languages and on the combinatorial structures of the new classes of languages are proved. As far as ETOL systems are concerned we prove that every ETOL language can be generated with a fixed (equal to 8) bounded degree of parallelism.
    Information and Control 02/1980; 44(2):134-163. DOI:10.1016/S0019-9958(80)90066-2
Show more