Modularization of Regular Growth Automata
Christian Wurm · 2011
Regular growth automata form a class of infinite machines, in which all local computations are performed by finite state automata. We present some results which are relevant to application in practice; apart from runtime, the most important one is modularization, that is, abstraction over subroutines. We use the new techniques to prove some results on substitution. 1