Now showing items 1-1 of 1

    • Descriptional complexity of lindenmayer systems 

      Sherzod, Turaev; G., Mavlankulov; Mohamed, Othman, Prof. Dr.; Mohd Hasan, Selamat, Assoc. Prof. (Institute of Engineering Mathematics, Universiti Malaysia Perlis, 2012)
      In this paper we study the nonterminal complexity of Lindenmayer systems with respect to tree controlled grammars. We show that all 0L, D0L and E0L languages can be generated by tree controlled grammars with at most five ...