1. Allender, E.: Arithmetic circuits and counting complexity classes. In: Krajek, J. (ed.) Complexity of Computations and Proofs, Quaderni di Matematica (2004)
2. Allender, E., Arvind, V., Mahajan, M.: Arithmetic complexity, kleene closure, and formal power series. Technical report (1997)
3. Lecture Notes in Computer Science;E Allender,2015
4. Alur, R., D’Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan,Y.: Regular functions, cost register automata, and generalized min-cost problems. CoRR, abs/1111.0670 (2011)
5. Alur, R., D’Antoni, L., Deshmukh, J.V., Raghothaman, M., Yuan, Y.: Regular functions and cost register automata. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25–28 June 2013, pp. 13–22 (2013)