मुख्य सामग्री पर जाएं
    • हिंदी ‎(hi)‎
      • English ‎(en)‎
      • Tamil ‎(ta)‎
      • عربي ‎(ar)‎
      • मराठी ‎(mr)‎
      • हिंदी ‎(hi)‎
      • বাংলা ‎(bn)‎
      • ਪੰਜਾਬੀ ‎(pan)‎
      • ગુજરાતી ‎(gu)‎
      • ଓଡ଼ିଆ ‎(or)‎
      • ಕನ್ನಡ ‎(kn)‎
    1. पाठ्यक्रम
    2. VTU THEORY
    3. VTU Sem 5
    4. Automata theory and Computability syllabus
    5. Module-4 Context-Free and Non-Context-Free Languages
    Techniques for TM construction.
    design of TM
    Language acceptability by TM
    Representation
    Turing Machine: Turing machine model
    Un-decidable questions
    Algorithms and Decision Procedures for CFLs: Decidable questions
    Deterministic CFLs.
    Important closure properties of CFLs
    Pumping theorem for CFL
    Showing a language is context-free
    Context-Free and Non-Context-Free Languages: Where do the Context-Free Languages(CFL) fit
    ब्लॉक से हट जायें

    ग्लोबल खोज

    Advanced search
    Data retention summary