Abstract
A model for self-modifying program schemata is presented. Essentially this augments Ianov program schemata with certain self-modifying primitives. An appropriate algorithm for the decomposition of a directed graph is developed and applied to yield an Ianov schema equivalent to a given self-modifying schema. Generalizations of the model are considered. In particular, certain growing programs are seen to lie outside the class of Ianov schemata.
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 callSimilar Papers
Disclaimer: 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.
