| Skip Navigation LinksHome > Question view

Question Answer

► MCQ Exam ON : It Theory Of Computation

The string (a) | ((b) * (c)) is equivalent to

1)		set of strings with either a or one or more b's and one c
2)		set of strings with either a or zero or more b's and one c
3)		both ( and (
4)		b* c l a
5)		NULL

Complaint Here As Incorrect Question / Answer

Important MCQ on Related Subject

📌	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

📌	In an incompletely specified automata

📌	If S be an infinite set and be sets such that S1 ∪ S2 ∪ .....∪ SN = S, then

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

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

📌	An FSM with__________________

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

📌	Can a DFA simulate NFA?

📌	The major difference between a moore and mealy machine is that

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

📌	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

📌	Regular expression a / b denotes the set

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

📌	The major difference between a moore and mealy machine is that

📌	An FSM with__________________

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

📌	Which of the following statements is wrong ?

📌	The string (a) \| ((b) * (c)) is equivalent to

📌	Can a DFA simulate NFA?

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

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

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

📌	Finite state machine can recognize

📌	The string (a) \| ((b) * (c)) is equivalent to

📌	Which of the following are not regular ?

📌	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

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

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