• recategorized by
351 views
0 0 votes

Let $L$ be a regular language and $F$ be a finite language over $\{0,1\}$. Consider the statements: (i) $L \cup F$ is regular, and (ii) $L \cup F^{c}$ is regular, where $F^{c}$ denotes the complement of $\text{F}$. Which of the following statements is correct?

  1. Both $\text{(i)}$ and $\text{(ii)}$ are true.
  2. $\text{(i)}$ is true but $\text{(ii)}$ is false.
  3. $\text{(ii)}$ is true but $\text{(i)}$ is false.
  4. Both $\text{(i)}$ and $\text{(ii)}$ are false.

     

1 Answer

1 1 vote

Answer is option (A)

i. L is regular and F is also regular (all finite languages are regular). regular language is closed under Union property, hence L U F will be regular 

ii. F' is regular as regular language is closed under complement property. Regular union Regular is Regular.

Both statements hold 

Position:
Show:

Related questions

0 0 votes
1 1 answer
338
338 views
admin asked Oct 10, 2024
338 views
 Let us consider the language $\left\{\epsilon, a, a^{2}, \ldots, a^{10}\right\}$, where $\epsilon$ denotes the empty string, and $a^{n}$ denotes $\underbrace{a a \cdots ...
0 0 votes
1 answers 1 answer
328
328 views
admin asked Oct 10, 2024
328 views
Let the regular expression of all the strings generated from English lowercase letters, which starts with a vowel, and has odd number of letters can be expressed as $[a+e...
0 0 votes
1 answers 1 answer
321
321 views
admin asked Oct 10, 2024
321 views
Which of the words below matches the regular expression $a(a+b)^{*} b+$ $b(a+b)^{*} a$ ?$a b a$$b a b$$a b b a$$a a b b$ 
1 1 vote
1 answers 1 answer
417
417 views
admin asked Oct 10, 2024
417 views
Which of the following properties is always applicable to the numbers generated by the regular expression $1[3+6+9]^{*} 8$ ?OddDivisible by $3$Divisible by $8$Divisible b...