Theory Of Computation

Easy

Medium

Difficult

2020

1. Languages and Grammars

2. Regular Language

3. Regular Expression

4. Decidability and Undecidability

5. Finite-Automata

6. Languages and Grammars

2019

1.Pumping Lemma

1.Regular Language

2.Countability

3.Context free languages



1.Finite Automata

2018

1.Finite Automata

2.Closure properties



1.CFL

2.Decidability

1.Finite Automata

2.Countability

2017 Set-1

1.Membership Function

1.CFG

2.Finite Automata

3.CFL(2)

1.Computability

2017 Set-2

1.DFA

1.CFL(2)

2.FA

3.NFA

4.Decidability

2016 Set-1

1.Regular Expression

1.Regular language

2.Decidability

3.Membership function

4.PDA

1.Recursively Enumerable

2016 Set-2

1.DFA

2.Closure Properties

1.RE

2.NFA

3.CFG

4.TM

Context Free Grammar

2015 Set-1

1. Closure property 

2. DFA

1. PDA

2015 Set-2

1. Decidability

2. Regular language 

3. DFA

1. Regular Grammar 

2015 Set-3

1. Regular Expression 

2. CFL

1. Reducibility

2014 Set-1

1. Finite Automata 

2. Closure property 

1. Regular Languages 

2. Regular Expressions 

2014 Set-2

1. Regular languages 

1. Reducibility

1. Turing machine 

2. Regular languages 

2014 Set-3

1. Countability

2. Decidability

1. Regular expression 

2. Contact free languages 

2013

1. Regular Expression 

2. Turing machine 

3. Context free language 

4. Regular language 

5. Undecidability

2012

1. Decidability

2. Regular expression 

1. Finite Automata 

2. Finite automata 

2011

1. Regular language 

2. Determinism and Non – Determinism 

1. Finite Automata(2)

2. Identify class language 

2010

1. Recursively Enumerable Languages 

1. Regular expression 

2. Context free language 

3. Finite Automata