Abstract
In an attempt to bridge the gap between theoretical computer science and, system theory, three problems from developmental system theory are discussed in parallel with the corresponding problems for discrete-time linear systems. The question of existence of algorithmic solutions to each of the problems is investigated. Based on elementary linear algebra, it is shown that each of the three problems is decidable for discrete-time linear systems while the equivalent problems for developmental systems are either undecidable or the existence of algorithmic solutions is an open problem. Developmental systems are studied in both theoretical biology and formal language theory so the discussion presented in this paper provides some fundamental links between these two subjects and linear systems theory.
Sign-in/Register to access full text options 
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.
