Skip to main content
Home
  • Home
  • Learn
    • Computer Science
      • Database Management System
      • Programming Language
      • Computer Networks
      • Theory of Computation
      • Digital Electronics
      • Algorithms
      • Compiler Design
      • Computer Organization and Architecture
      • Data Science
      • Data Structures
      • Operating System
      • Software Engineering
      • Web Technologies
      • Machine Learning
      • Search Engine Optimization
      • Information Security
    • General
      • Mathematics
      • Aptitude
    • Courses
      • Algorithms
      • Compiler design
      • Computer Networks
      • Computer Organisation
      • Data Structures
      • Database Management System
      • Digital Logic Design
      • Mathematics
      • Operating Systems
      • Programming in C
      • Theory of Computation
  • Practise
    • Doubts
    • Solved Examples
    • Virtual GATE
  • Quiz
  • Class Rooms
  • Blog
  • More
    • Reach to us
      • Contact Us
      • Request a Topic
      • Join us
      • Internship
      • Teach with Techtud
      • GATE 2018 Feedback
    • Your Interview
      • Professor's Interview
      • Research Scholar's Interview
      • Exam topper's interview
    • About
      • About Techtud
      • The Team
      • User Levels and Credentials
      • Benefits
      • Earn Techtud Tee
  • Login / Register
Theory of computation

Theory of computation for GATE CS

DFA, NFA, Mealy - Moore, Regular Expression

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut a massa dictum, facilisis ante eu, faucibus libero.

DFA/ NFA
Mealy- Moore Machines, RE, Regular language
PDA , CFL and LBA
Turing Machines, Decidability
  • Log in or register to post comments
  • 1464 reads

Quick Links

  • Doubts

About

  • The Team
  • User Levels & Credentials

Reach to Us

  • Contact Us
  • Join Us
  • Request a Topic

Media Coverage

TOI
YS
BS

Subscribe

Proudly supported by OpenSense Labs