1998/01/17 by Yuri Ozhigov, Ozhigov, Yuri
Physics and Astronomy · #Cellular Automata and Lattice Gases (nlin.CG) #FOS: Physical sciences #comp-gas #nlin.CG
paper · pdf · doi:10.48550/arxiv.comp-gas/9801002
11 pages in AmsTex, no figures
arxiv created 1998/01/17 · arxiv updated 2009/11/30
LS is a particular type of computational processes simulating living tissue. They use an unlimited branching process arising from the simultaneous substitutions of some words instead of letters in some initial word. This combines the properties of cellular automata and grammars. It is proved that 1) The set of languages, computed in a polynomial time on such LS that all replacing words are not empty, is exactly NP- languages. 2) The set of languages, computed in a polynomial time on arbitrary LS, contains the polynomial hierarchy. 3) The set of languages, computed in a polynomial time on a nondeterministic version of LS, strictly contains the set of languages, computed in a polynomial time on Turing Machines with a space complexity na, where a is positive integer. In particular, the last two results mean that Lindenmayer systems may be even more powerful tool of computations than nondeterministic Turing Machine.