Abstract
Growth functions of informationless Lindenmayer systems are investigated from the point of view of integral sequential word functions. Algorithms are obtained for the solution of equivalence, minimization and construction problems. It is found out that some of the inclusion relations between language families do not remain valid for the corresponding families of growth functions. Some results concerning context-dependent Lindenmayer systems, as well as growth relations of OL-systems are also obtained.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
