References
for Further Reading
A. V. Aho and J. D. Ullman. 1972. The Theory of Parsing, Translation, and Compiling. Vol. 1, Englewood
Cliffs, N.J.: Prentice Hall.
P. J. Denning, J. B. Dennis, and J. E. Qualitz. 1978. Machines, Languages, and Computation. Englewood
Cliffs, N.J.: Prentice Hall.
M.R. Garey and D. Johnson. 1979. Computers and Intractability Freeman.
M. A. Harrison. 1978. Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley.
J. E. Hopcroft and J. D. Ullman. 1979. Introduction to Automata Theory, Languages and Computation.
Reading, Mass.: Addison-Wesley.
R. Hunter. 1981. The Design and Construction of Compilers. Chichester, New York: John Wiley.
R. Johnsonbaugh. 1996. Discrete Mathematics. Fourth Ed. New York: Macmillan.
Z. Kohavi and N.K. Jha. 2010. Switching and Finite Automata Theory. Third Edition. Cambridge
University Press.
C.H. Papadimitriou. 1994. Computational Complexity. Reading, Mass.: Addison-Wesley.
G.E. Revesz. 1983. Introduction to Formal Languages. McGraw-Hill.
A. Salomaa. 1973. Formal Languages New York: Academic Press.
A. Salomaa. 1985. “Computations and Automata,” in Encyclopedia of Mathematics and Its Applications.
Cambridge: Cambridge University Press.