Theory of Computer Science Automata Languages and Computation

Theory of Computer Science Automata Languages and Computation

PDF Free Download | Theory of Computer Science Automata Languages and Computation

Table of contents


  • Propositions AND Predicates
  •  Mathematical Preliminaries
  • The Theory of  Automata
  • Formal Languages
  • Regular Sets and Regular Grammars
  • Context-free Languages
  • Pushdown Automata
  • LR(k) Grammars
  • Turing Machines and Linear Bounded Automata
  • Decidability and Recursively Enumerable Languages
  • Computability
  • Complexity
FileAction
Theory of Computer Science Automata Languages and Computation.pdfDownload 
Scroll to Top