Abstract
We improve several upper bounds to the complexity of the membership problem for languages defined by iterated morphisms (D0L systems). The complexity bounds are expressed in terms of DLOGTIME-uniform circuit families. We prove: 1) For polynomially growing DOL systems the membership problem is contained in AC 0. 2) For arbitrary DOL systems the membership problem is contained in NC 1. 3) The latter can be improved to TC 0 if and only if upper bounds to a number of natural arithmetic problems can be improved to TC 0. 4) The general D0L membership problem (the D0L system is part of the input) is contained in Cook's class DET.
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.
