Theory Of Computation MCQ - Regular languages and finite automata

1. Home
2. Computer Science MCQ
3. Theory Of Computation MCQ
4. Regular languages and finite automata

41:  

 The regular sets are closed under

A.	union
B.	concatenation
C.	Kleene's closure
D.	all of these
	Answer Report Discuss
	Option: D Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

42:  

 Dynamic errors can be detected at

A.	compile time
B.	Run time
C.	both (a) and (b)
D.	none of these
	Answer Report Discuss
	Option: B Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

43:  

If a and b be the regular expressions, then ( a*  ∪ b* ) *  is equivalent to 

A.	(a ∪ b) *
B.	(b* ∪  a*)*
C.	(b ∪ a)*
D.	All of above
	Answer Report Discuss
	Option: D Explanation : Click on Discuss to view users comments. T. Sudhakar said: (6:08pm on Thursday 11th August 2016) options B and C are also correct.All generating zero or more number of a's and b's Write your comments here: Updating your Comments.. Updating your Comments..

44:  

 Finite state machines _________ recognize palindromes

A.	can
B.	can't
C.	may
D.	may not
	Answer Report Discuss
	Option: B Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

45:  

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

 

A.	S ⊂ T
B.	T⊂ S
C.	S = T
D.	S ∩  T= φ
	Answer Report Discuss
	Option: C Explanation : Click on Discuss to view users comments. Write your comments here: Updating your Comments.. Updating your Comments..

• «
• 1
• 2
• 3
• 4
• 5
• 6
• 7
• 8
• 9
• 10
• 11
• 12
• »