Bibliography

[bib01_001] Aho, AV and MJ Corasick (1975). ‘Efficient string matching: an aid to bibliographic search’. Comm. ACM 18: 6, 333–340.

[bib01_002] Aho, AV, JE Hopcroft and JD Ullman (1974). The Design and Analysis of Computer Algorithms. Reading, Mass: Addison-Wesley.

[bib01_003] Aho, AV, and JD Ullman (1970). ‘A characterization of two-way deterministic classes of languages’. J. Comput. Syst. Sci. 4: 6, 523–538.

[bib01_004] Aho, AV, and JD Ullman (1972). The Theory of Parsing, Translation and Compiling, Vol. I: Parsing. Englewood Cliffs, New Jersey: Prentice Hall.

[bib01_005] Aho, AV, and JD Ullman (1972). The Theory of Parsing, Translation and Compiling, Vol. II: Compiling. Englewood Cliffs, New Jersey: Prentice Hall.

[bib01_006] Aho, AV, ...

Get Introduction to Formal Languages, Automata Theory and Computation now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.