An Introduction to Formal Languages and Automata

Peter R Linz · 1990

Introduction to the theory of computation -- Finite automata -- Regular languages and regular grammars -- Properties of regular languages -- Context-free languages -- Simplification of context-free grammars and normal forms -- Pushdown automata -- Properties of context-free languages -- Turing machines -- Other models of turing machines -- A hierarchy of formal languages and automata -- Limits of algorithmic computation -- Other models of computation -- An overview of computational complexity -- Compilers and parsing -- LL parsing -- LR parsing.

Read the paper · More papers on PaperTik