An Introduction to computable languages and abstract machines

From languages to computation Elements of formal languages Syntax, semantics and ambiguity Regular languages and finite state recognizers Context free grammars and pushdown recognizers Important features of regular and context free languages Phrase structure languages and Turing machines From computation to languages Finite state transducers Turing machines as computers Dimensions of computation The limits of computation and the scope of phrase structure languages Postscript.