Skip to main content
    • English ‎(en)‎
      • English ‎(en)‎
      • Tamil ‎(ta)‎
      • عربي ‎(ar)‎
      • मराठी ‎(mr)‎
      • हिंदी ‎(hi)‎
      • বাংলা ‎(bn)‎
      • ਪੰਜਾਬੀ ‎(pan)‎
      • ગુજરાતી ‎(gu)‎
      • ଓଡ଼ିଆ ‎(or)‎
      • ಕನ್ನಡ ‎(kn)‎
    1. Labs
    2. VTU THEORY
    3. VTU Sem 5
    4. Automata theory and Computability syllabus
    5. Module-1 Why study the Theory of Computation, Languages and Strings
    Bidirectional Transducers.
    Transducers
    Finite State
    Canonical form of Regular languages
    Minimizing FSMs
    Simulators for FSMs
    From FSMs to Operational Systems
    Nondeterministic FSMs
    Designing FSM
    Regular languages
    Finite State Machines(FSM): Deterministic FSM
    Computation
    A Language Hierarchy
    Languages and Strings: Strings Languages
    Why study the Theory of Computation
    Skip Global search

    Global search

    Advanced search
    Data retention summary