Abstract
Terminal weights are attached to L-systems by replacing each terminal generated by an EOL-(OL-) System by fa(i) in the ith step of a derivation. The family of terminal weighted OL-languages will be equal to the recursively enumerable set. A machine model called time varying RPAC Automation is constructed and the equivalence of time varying RPAC Automation with Terminal Weighted EOL System is established.
C.R Categories: