If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?

Home / Engineering / Theory of Computation / Question

M

Mr. Dubey • 51.17K Points
Coach

Q.) If a language is denoted by a regular expression L = ( x )* (x y x ), then which of the following is not a legal string within L ?

(A) yx

(B) xyx

(C) x

(D) xyxyx

Correct answer : Option (D) - xyxyx

Share

Discusssion

Login to discuss.

Related MCQs on Theory of Computation

Q. Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable languages are closed under union and complementation. (3) Turing decidable languages are closed under intersection and complementation (4) Turing recognizable languages are closed under union and intersection.

Q. Which of the following commands is used to save the output of the who command in a file named user.lst, as well as display it?

Q. Which one of the following is not an application layer protocol used in internet?

Q. Which of the following logic families has the highest maximum clock frequency?

Q. ___________ are wireless network standard with a data rate of only 2Mbps

Q. One output structure of a TTL gate is often referred to as a

Q. When number of switch ports is equal to or larger than number of devices, this simple network is referred to as ______________

Q. The Boolean data type:

Q. If an Optical Carrier is represented as OC-n, generally the link speed equals(in Mbps) __________

Q. The personnel who deals with the computer and its management put together are called