Catalog search

Catalog links

• Catalog home
• Site map
• Alphabetical index

CMP 762: Automata Theory.

4 hours, 4 credits. Finite automata and related devices, the Chomsky hierarchy of formal grammars, equivalence of generative grammar characterizations of languages with recognition by restricted classes of machines, normal forms, computational complexity, intractable problems.

Last modified: 1/23/2013