1. Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling, vol. I. Prentice-Hall, Englewood Cliffs (1972)
2. Baker, B.S., Book, R.V.: Reversal-bounded multipushdown machines. Journal of Computer and System Sciences 8, 315–332 (1974)
3. Bertoni, A., Choffrut, C., Goldwurm, M., Lonati, V.: On the number of occurrences of a symbol in words of regular languages. Theoretical Computer Science 302, 431–456 (2002)
4. Lecture Notes in Computer Science;A. Bertoni,2000
5. Crestin, J.: Un langage non ambigu dont le carré est d’ambiguité non bornée. In: Nivat, M. (ed.) Automata, Languages and Programming, pp. 377–390. North-Holland, Amsterdam (1973)