Regular Languages | Techtud

Skip to main content

Home
Learn
Courses

Theory of Computation

Operating Systems

Mathematics

Digital Logic Design

Database Management System

Data Structures

Computer Organisation

Computer Networks

Compiler design

Algorithms

Programming in C
Practise
Doubts

Solved Examples

Virtual GATE
Quiz
Classrooms
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

Search Courses, Topics, Classroom and Educators

Theory of Computation

Introduction
- What is Theory of Computation
- Basic Terms
Automata
Classification of Grammar
Regular Languages
Context Free Languages
Context Sensitive Languages
- Context Sensitive Grammars
- Linear Bounded Automata for CFLs
Turing Machines
Decidability

Notes
Video
Example
Resource
Doubts
Quiz

Gate1995_2.24
- Mohit Lalwani
- 3 years 5 months ago

Gate1995_1.9
- Mohit Lalwani
- 3 years 5 months ago

Gate1996_1.10
- Mohit Lalwani
- 3 years 5 months ago

Gate1996_1.8
- Mohit Lalwani
- 3 years 5 months ago

Gate1997_6.4
- Mohit Lalwani
- 3 years 5 months ago

Gate1998_1.12
- Mohit Lalwani
- 3 years 6 months ago

Gate1998_1.9
- Mohit Lalwani
- 3 years 6 months ago

Gate200_2.8
- Mohit Lalwani
- 3 years 6 months ago

Gate2000_1.4
- Mohit Lalwani
- 3 years 6 months ago

Gate2001_2.6
- Mohit Lalwani
- 3 years 6 months ago

Gate2001_1.4
- Mohit Lalwani
- 3 years 6 months ago

Gate2003_14
- Mohit Lalwani
- 3 years 6 months ago

Pages

1
2
3
next ›
last »

Quick Links

Doubts

About

The Team
User Levels & Credentials

Reach to Us

Contact Us
Join Us
Request a Topic

Media Coverage

Subscribe

Proudly supported by OpenSense Labs