Introduction to Automata Theory, Languages, and Computation
description
Preliminaries. Finite automata and regular expressions. Properties of regular sets. Context-free grammars. Pushdown automata; Properties of context-free languages. Turing machines. Undecidability. The Cohmsky hierarchy. Heterministic context-free languages. Closure properties of families of languages. Computational complexity theory. Intractable problems. Highlights of other important language classes.
read more
pages
436
Year published
1979
Publisher
Addison Wesley Publishing Company
Issn
0-201-02988-X
Language
en
categories