Solved

Let the Class of Language Accepted by Finite State Machine

Question 22

Multiple Choice

Let the class of language accepted by finite state machine be L₁ and the class of languages represented by regular expressions be L₂ then

A) L₁
B) L₁>=L₂
C) L₁ U L₂ = .*
D) L₁=L₂

Related Questions

Q17: If L1 and L2 are context free

Q18: Which of the following pairs have DIFFERENT

Q19: Any Language generated by an unrestricted grammar

Q20: Context free grammar is not closed under A)Product

Q21: Following syntax-directed translation scheme is used with

Q23: What is the highest type number which

Q24: TM is more powerful than FSM because A)The

Q25: Let L1 be a recursive language. Let

Q26: If L and L¯ are recursively enumerable,

Q27: Which of the following statement is wrong? A)Any