An efficient derivation method for DTOL systems and a measure of derivation complexity

Authors:
Taishin Y. Nishida
Affiliations:
Faculty of Engineering, Toyama Prefectural University, Imizu-shi, Toyama, Japan
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2009

Citing 11
Cited 0

Public-key cryptography

Public-key cryptography
Language-theoretic problems arising from Richelieu cryptosystems

Theoretical Computer Science
Closure properties of slender languages

Theoretical Computer Science
On a conjecture about slender context-free languages

Theoretical Computer Science
Thin and slender languages

Discrete Applied Mathematics
Slender 0L languages

Theoretical Computer Science
On slender 0L languages

Theoretical Computer Science
On slender 0L languages over the binary alphabet

Acta Informatica
Handbook of Formal Languages

Handbook of Formal Languages
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Some new aspects of word-length controlled DT0L systems

Journal of Automata, Languages and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient derivation method for DTOL systems is proposed. The method, called a lazy derivation, makes two morphisms from a morphism applied at every step. One morphism simulates the original derivation but it is an identity over a set of letters on which every morphism of the system is a bijective coding. The other morphism recovers the original derivation. Generative complexities of a word by normal and Jazy derivations are defined. It is shown that, for any integer k ≥ 1, there is a DTOL system such that the generative complexities per letter of a word w by normal and lazy derivations are Θ(|w|1/k) and Θ(1), respectively.