Regular Expressions | Techtud

Skip to main content

Home
Classrooms
Quiz
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_1.9
- Mohit Lalwani
- 3 years 10 months ago

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

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

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

Gate2003_14
- Mohit Lalwani
- 3 years 10 months ago

Gate2007_74
- Mohit Lalwani
- 3 years 10 months ago

Gate2008_52
- Mohit Lalwani
- 3 years 10 months ago

Gate2010_39
- Mohit Lalwani
- 3 years 10 months ago

Solved Example on Regular Expressions
- PREETI KAUR
- 4 years 3 months ago

Which one of the following languages over the alphabet {0,1} : GATE-2009
- Neha
- 4 years 6 months ago

Let L = { w ∈ ( 0 + 1 )* | w has even number of 1s } , i.e. L is the set : GATE-2010
- Neha
- 4 years 7 months ago

The length of the shortest string NOT in the language (over S = {a,b}) : GATE-2014
- Neha
- 4 years 7 months ago

Pages

1
2
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