References – Introduction to Automata Theory, Formal Languages and Computation

References

Aho, Hopcroft and Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley.

Aho, Sethi, Ullman, Compilers Principles, Techniques and Tools, Pearson Education, 2003.

Hopcroft and Ullman, Introduction to Automata Theory, Languages and Computation, Addison Wesley.

Kohavi, ZVI, Switching And Finite Automata Theory, Tata McGraw-Hill, 2006.

Lewis and Papadimitriou, Elements of the Theory of Computation, Prentice-Hall.

Martin, Introduction to Languages and the Theory of Computation, McGraw-Hill, 2nd edition,1996.

Mishra, KLP, Chandrasekaran, N. Theory of Computer Science, (Automata, Languages and Computation) PHI, 2002.

Pandey, An Introduction to Automata Theory and Formal Languages, S. K. Kataria & Sons, 2010.

Pandey, Concept of Compiler Design, S. K. Kataria & Sons, 2010.

Moore, Edward F. “Gedanken-experiments on Sequential Machines”. Automata Studies, Annals of Mathematical Studies (Princeton, N.J.: Princeton University Press) (34): 129–153.

Mealy, George H. A Method to Synthesizing Sequential Circuits. Bell Systems Technical Journal. 1955, 1045–1079.

Chomsky, Noam. “Three models for the description of language”. IRE Transactions on Information Theory, 1956, 113–124.

Davis et al. Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science. Boston: Academic Press, Harcourt, Brace, 1994, 327.

S. Y. Kuroda, “Classes of languages and linear-bounded automata”, Information and Control, 7(2), 1964, 207–223.

“Two way Finite Automata” http://www.cs.cornell.edu/courses/cs682/2008sp/Handouts/2DFA.pdf

Cole Richard “Converting CFGs to CNF” http://www.cs.nyu.edu/courses/fall07/V22.0453-001/cnf.pdf.

“Greibach Normal Form” http://www.iitg.ernet.in/gkd/ma513/oct/oct18/note.pdf.

Seungjin Choi, “Context-Free Grammars: Normal Forms” http://www.postech.ac.kr/~seungjin/courses/automata/2006/handouts/handout07.pdf.

“Simplification of CFG” http://www.cs.cmu.edu/~lblum/flac/Homeworks/hw3.pdf.

“Backus-Naur Form” http://www.math.grin.edu/~stone/courses/languages/Backus-Naur-form.pdf.

Scott, Dana and Rabin, Michael “Finite Automata and Their Decision Problems”. IBM Journal of Research and Development 3(2), 1959, 114–125.

Ogden, W. “A helpful result for proving inherent ambiguity”. Mathematical Systems Theory 2(3), 1968, 191–194.

“Ogden’s Lemma” http://www.cs.binghamton.edu/~lander/cs573/pdf/cs573print424.pdf.

Helmbold David, “Example of Converting a PDA into a CFG”, http://classes.soe.ucsc.edu/cmps130/Fall10/Handouts/PDA-CFGconv.pdf.

Church, Alonzo, “An Unsolvable Problem of Elementary Number Theory”. American Journal of Mathematics 58(58), 1936, 345–363.

Church, Alonzo, The Calculi of Lambda-Conversion. Princeton: Princeton University Press, 1941.

E. Horowitz and Shani, “Fundamentals of Computer Algorithms” Galgotia Publication.

Weiss, Weiss Mark Allen, “Data Structures And Algorithm Analysis In C++, 3/E”, Pearson Education.

Puntambekar A. A, “Principle of Compiler Design”, Technical Publication, Pune.

Robin Hunter, “The Essence of Compiler Design”, Pearson Education.