Regular Languages | Techtud

Skip to main content

Home
Classrooms
Quiz
Blog
More
Reach us

Contact Us

Internship
About

About Techtud

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
- 4 years 7 months ago

Gate1995_1.9
- Mohit Lalwani
- 4 years 7 months ago

Gate1996_1.10
- Mohit Lalwani
- 4 years 7 months ago

Gate1996_1.8
- Mohit Lalwani
- 4 years 7 months ago

Gate1997_6.4
- Mohit Lalwani
- 4 years 7 months ago

Gate1998_1.12
- Mohit Lalwani
- 4 years 7 months ago

Gate1998_1.9
- Mohit Lalwani
- 4 years 7 months ago

Gate200_2.8
- Mohit Lalwani
- 4 years 7 months ago

Gate2000_1.4
- Mohit Lalwani
- 4 years 7 months ago

Gate2001_2.6
- Mohit Lalwani
- 4 years 7 months ago

Gate2001_1.4
- Mohit Lalwani
- 4 years 7 months ago

Gate2003_14
- Mohit Lalwani
- 4 years 7 months ago

Pages

1
2
3
next ›
last »

Quick Links

Terms and Services

About

About Techtud

Reach us

Contact Us
Join Us

Media Coverage

Subscribe

Proudly supported by OpenSense Labs