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.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
