1. I. Borchhardt: Nonrecursive Tradeoffs between Context-free Grammars with Different Constant Ambiguity, Master Thesis, Universität Frankfurt/Main (1992, in German)
2. J. Goldstine, C. M. R. Kintala, D. Wotschke: On Measuring Nondeterminism in Regular Languages, Information and Computation 86 (1990), 179–194
3. M.A. Harrison: Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, (1978)
4. C. Herzog: Pushdown Automata with Bounded Nondeterminism or Bounded Ambiguity, Master Thesis, Universität Frankfurt/Main (1994, in German)
5. J.E. Hopcroft, J.D. Ullman: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, (1979)