Theory of Automata Archives | Page 19 of 32

(A) (a+b)*aa(a+b)* generates Regular language
(B) A language consisting of all strings over Σ=,a,b- having equal number of a’s and b’s is a regular language
(C) Every language that can be expressed by FA can also be expressed by RE
(D) None of these

►Correct Option

Tag: Theory of Automata

Let L be any infinite regular language, defined over an alphabet Σ then there exist three strings x, y and z belonging to Σ* such that all the strings of the form xy z n for n=1,2,3, … are the words in L. called Complement of L?

The languages __ are the examples of non regular languages.

Choose the incorrect statement?

The language that can be expressed by any regular expression is called a Non regular language?

The regular expression defining the language L1 U L2 can be obtained, converting and reducing the previous into a as after eliminating states.

L= language of words containing even number of a’s. Regular Expression is?

If L1 and L2 are two regular languages, then L1 U L2 is not a regular?

Converting each of the final states of F to non-final states and old non-final states of F to final states, FA thus obtained will reject every string belonging to L and will accept every string, defined over Σ, not belonging to L. is called?