A regular language over an alphabet ∑ is one that cannot be obtaine – McqOptions

MCQOPTIONS

1.	A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
A.	Union
B.	Concatenation
C.	Kleene*
D.	All of the mentioned
Answer» E.

Discussion

No Comment Found

Related MCQs

Given: ∑= {a, b}L= {xϵ∑*|x is a string combination}∑4 represents which among the following?
For the following change of state in FA, which of the following codes is an incorrect option?
The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and ∑={0,1} is_________
Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its states; Statement 3: The edges or arcs can be used for transitionsHint: Nodes and Edges are for trees and forests too.Which of the following make the correct combination?
A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages using the operation
FOR_THE_FOLLOWING_CHANGE_OF_STATE_IN_FA,_WHICH_OF_THE_FOLLOWING_CODES_IS_AN_INCORRECT_OPTION??$
The number of elements in the set for the Language L={x‚âà√¨¬¨¬µ(‚Äö√Ñ√∂‚àö‚Ä†‚àö¬¥r) *|length if x is at most 2} and ‚Äö√Ñ√∂‚àö‚Ä†‚àö¬¥={0,1} is________?#
If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the infinite input tape is ______________
Which of the following is a not a part of 5-tuple finite automata?
The minimum number of states required to recognize an octal number divisible by 3 are/is