| Skip Navigation LinksHome > Question view

Question Answer

► MCQ Exam ON : Theory Of Computation

An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length

1)		rewinding capacity, and unidirectional tape movement
2)		without rewinding capability and unidirectional tape movement.
3)		rewinding capability and bidirectional tape movement
4)		without rewinding capability and bidirectional tape movement
5)		NULL

Complaint Here As Incorrect Question / Answer

Important MCQ on Related Subject

📌	L = {aP \| p ; } is prime is

📌	Which of the following pairs of regular expressions are equivalent?

📌	Can a DFA simulate NFA?

📌	Which of the following can be recognized by a Deterministic Finite-state Automaton ?

📌	In an incompletely specified automata

📌	An automation is a __________ device and a grammar is a __________ device.

📌	If regular set A is represented by A = (01 1)* and the regular set \'B\' is represented by B = ((01)1)*, then

📌	Regular expression corresponding to the state diagram given in the Figure is

📌	If f : {a, b}* —> (a, b}* be given by f (n) = ax for every value of n ∈ (a, b}, then f is

📌	Finite state machine can recognize

📌	If w ∈ (a, b)* satisfy abw = wab, then (w) is

📌	A language L is accepted by a finite automaton if and only if it is

📌	Which of the following regular expressions denotes a language comprising all possible strings over the alphabet {a, b } ?

📌	An FSM with__________________

📌	Which of the following regular expressions denotes zero or more instances of an a or b ?

📌	Running time of NFA to DFA conversion including the case where NFA has e-transition i

📌	. If w ∈ (a, b)* satisfy abw = wab, then (w) is___________

📌	Any given transition graph has an equivalent

📌	Regular expression a / b denotes the set

📌	Vienna Definition Language is an example of language definition facility based on

📌	The main difference between a DFSA and an NDFSA is

📌	If S and T be language over Σ = {a, b } represented by regular expression (a b * ) * and (a b) * , respectively, then

📌	Palindromes can\'t be recognized by any FSM because

📌	Consider regular expression (0 1) (0 1) ....... n times. Minimum state finite automaton that recognizes the language represented by this regular expression contains

📌	Which of the following regular expressions denotes a language comprising all possible strings of even length over the alphabet ( 0 , 1 ) ?

📌	If ∑ = {a, b, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used more than once in a string is

📌	The regular expression (a \| b)* denotes the set of all strings

📌	Which string recognize it ?

📌	Regular expression (a \| b ) (a \| b) denotes the set

📌	Which of the following are not regular ?

Online GK

General Knowledge Multiple choice GK Questions MCQ on current affairs quiz

Get General Knowledge Multiple choice GK Questions MCQ on current affairs quiz, All GK based Exams mcq quiz and also examine your ability for SSC, Banking, IAS, UPSC, CLAT, IBPS Competitive Examinations, online general knowledge preparation, College Level Quiz, Medical, Engineering, MBA BBA

Online GK Give Online General Knowledge Test for All Exam GK. Each of the below online tests consists of ten multiple choice objective type questions with answers. In the tests, simply select one of the answer choices. Your answer will be marked immediately by indicating or . Also, the correct answer will be highlighted in green colour.

mcq quiz multiple choice questions test for gk based exams, educational questions with answer MCQ GK explaination. Here Get Study of All GK for Competition Exam. We provide fully solved Online General Knowledge Quiz preparation. you can learn and practice Online free. solve General Knowledge Multiple choice GK Quiz online, Study and Tips general knowledge mcq. General Knowledge Multiple choice GK Questions MCQ on current affairs quiz.

Managed Services By: www.upscgk.com