Contact at mumbai.academics@gmail.com or 8097636691
Responsive Ads Here

Saturday, 3 March 2018

Formal Languages and Automata Theory

6. Formal Languages and Automata Theory
  • Automata Computablilty Complexity
  • Mathematical Notions Terminology
  • Definitions, Theorems, and Proofs
  • Types Of Proofs
  • Regular Languages
  • Context Free Languages
  • The Church Turning Thesis
  • Decidability
  • Reducibility
  • Advanced Topics in Computability Theory
  • Time Complexity
  • Space Complexity
  • Intractability
  • Advance Topics in Complexity Theory
  • Space Complexity
  • Intractability
  • Advance Topics in Complexity Theory
  • Mathematical Notation and Techniques
  • Regular Languages and Finite Automata
  • Mathematical induction and Recursive Functions
  • Non Determinism and Kleen’s Theorem
  • Turning Machines and Their Languages
  • Unsolved Problems and Computable Functions
  • Regular Expressions and Finite Automata
  • Mathematical Inductions and Recursive Functions
  • Context Free grammars
  • Pushdown Automata
  • Recursively Enumerable Funtions
  • Tractable and Intractable Problems
  • Computable Functions
  • Measuring and Classifying Complexity
  • No comments:

    Post a Comment