References
- Hopcroft, J., Motwani, R., Ullman, J. D. (2001). Introduction to Automata Theory, Languages, and Computation, 2nd ed. Boston, MA: Addison-Wesley.
- Kleene, S. C. (1956). Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J., eds. Automata Studies. Princeton, NJ: Princeton Univ. Press, pp. 3–42.
- Kozen, D. C. (2006). Theory of Computation. London: Springer-Verlag.
- Krohn, K., Rhodes, J. (1965). Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116: 450–464.
- Myhill, J. (1957). Finite automata and the representation of events. Technical Report WADC TR-57-624, Dayton, OH: Wright Patterson Air Force Base.
- Nerode, A. (1958). Linear automaton transformations. Proc. Amer. Math. Soc. 9: 541–544.
- Parikh, R. (1966). On context-free languages J. ACM. 13: 570–581.
- Schützenberger, M. P. (1955–1956). Une théorie algébrique du codage. Séminaire Dubreil. Algébre et Théorie des Nombres 9: 1–24. numdam.org/item?id=SD_1955-1956__9__A10_0
- Shotts Jr., W. E. (2012). Linux Command, the Linux command line. linuxcommand.org/tlcl.php
- Sipser, M. (2012). Introduction to the Theory of Computation, 3rd ed. Boston, MA: Cengage Learning.