Function composition and automatic average case analysis Original Research Article

We define the composition of functions defined over extended context-free languages. We show that this composition is automatically computable. It enables the automatic analysis of complex problems with small input descriptions, for example repeated differentiation or iterated automata on regular languages.