Abstract
The classes of functions IGF and IGF0 are investigated that can be computed by means of special index grammars. The class IGF0 is demonstrated to coincide with the class of strictly increasing functions (of a natural argument), which can be represented by systems of linear recurrence relations with natural coefficients, and to be closed with respect to the operations of addition, multiplication, series summation, and addition of a natural number to their arguments or results.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
