Introduction to Theoretical Computer Science or Theory of Computation

This note covers the following
topics: introduction to theoretical computer science, language, regular
language, finite automata, language accepted by dfa, nondeterministic finite
automata, equivalence of nfa, regular language and fa, application of fa,
nonregular languages, context free languages, turing machines, computability
and complexity.

**Author(s):** Pavan
Kumar Anumula, Andrea Di Fabio and Jia Zhu

NA Pages