Sign In 
Here we are trying to post all the free resources as per our knowledge to solve the Previous years UGC NET and GATE questions.
Please try to share more resources to help others.
30 GATE Previous Year Questions – Finite Automata in TOC
150 Short Tricks : Closure Properties & Previous Year Questions (TOC) – GATE & UGC NET
Theory Of Computation GATE Previous Year Questions from 1989 to 1998 Finite Automata
by NTA UGC NET Computer Science CSE channel.
Grammar TOC/Theory of Computation GATE Questions with Answers | Regular, Linear, Reduced, Ambiguous
by Gradeup- GATE, ESE, PSUs Exam Preparation
Regular Expression, Finite Automata GATE Questions and Answers | GATE 2019 Computer Science
by Gradeup- GATE, ESE, PSUs Exam Preparation
Which of the following languages is regular?
Comment List
Leave a comment
You must be logged in to post a comment.
Great work Mam, Really very useful and appreciable.
Helpful for every IT/CS students.
Thanks a lot
Please share more useful links related to this topics.
I think GATE Q 1994
“State True or False with one line explanation
A FSM (Finite State Machine) can be designed to add two integers of any arbitrary length (arbitrary number of digits).”
ans should be False : As FSM has a finite memory then it can not store carry to add arbitary length strings.
Am I wrong??