Recent questions tagged regular-language

Which classification is correct?$\{w\in \{0,1\}^* \mid \#0(w)=\#1(w)\}$ is regular.  $\{w\in \{0,1\}^* \mid \#0(w)=\#1(w)\}$ is not regular.  $\{w\in \{0,1\}^* \mid \#01(...

For $L=\{a^n b^n\mid n\ge0\}$, which choice correctly proves non-regularity using Myhill-Nerode?Use $S=\{a^i\mid i\ge0\}$ and distinguish $a^i$ from $a^j$ using suffix $b...

Let $L=\{w\in{0,1}^*\mid w$ contains equal numbers of substrings $01$ and $10\}$. Which statements are correct?$L$ is regular. A correct regular expression for $L$ is $\e...

Let $L_n=\{0^n1^n\}$ for each $n\ge0$. Which statements are correct?Each $L_n$ is regular. Any finite union of such languages is regular. $\bigcup_{n\ge0}L_n=\{0^n1^n\mid...

Let $L_1$ be a DCFL and $R$ be a regular language over the same alphabet. Which languages are guaranteed to be DCFL?$L_1\cap R$ $L_1\cup R$ $L_1-R$ $L_1^R$ $L_1\cap L_2$,...

Which of the following statements are always true?Every language generated by a regular grammar is regular. Every regular language can be generated by a regular grammar. ...

Which of the following languages are regular?$L_1 = \{x \mid x$ has two $0$s separated by the number of positions that is a multiple of $4\}$ $L_2 = \{x \mid x$ is binary...

Which of the following languages is non-regular? $(w^R$ is the reverse of string $w)$$L_1 = \{ww^R \mid w \in \{0,1\}^*\}$  $L_2 = \{ww^Rx \mid w,x \in \{0,1\}^*\}$  $L_3...

Which of the following languages is non-regular? $L_1 = \{x \mid x \in \{a,b\}^*$ and $x$ has even number of $b\}$  $L_2 = \{x \mid x \in \{a,b,c\}^*$ and $x$ has no $c$ ...

Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason RAssertion A: If $L$ is regular, then its compliment $L^{\prime}$ is ne...

Arrange the following in the order of execution while proving a Language is non-Regular using Pumping Lemma.Split in to $x y z$ satisfying pumping Lemma conditions.Assume...

If $r_{1}$ and $r_{2}$ are regular expressions, then which of the following are correct.$\mathrm{L}\left(\mathrm{r}_{1}+\mathrm{r}_{2}\right)=\mathrm{L}\left(\mathrm{r}_{...

Q5b) Given RE to DFA: (b/a)*baa(Show Answer with Drawing and steps)  

Consider the following DFA that generates set of strings over $\Sigma=\{a, b, c\}$Now identify that which of the followings is the best description of the language for th...

Which of the following is $\text{TRUE}$ about the Pumping Lemma for regular language?It applies to all regular languageIt applies only to infinite regular languagesIt app...

A machine is represented by states $Q$, input alphabet $\sum$, transition function $\delta$. Initial state $q_{0}$ and final state $F$. The machine accepts all the string...

Which of the following is not a palindromic subsequence of the string "$\text{ababcdabba}$"?$\text{abcba}$$\text{abba}$$\text{abbbba}$$\text{adba}$

Let $\text{L}=\{a b, a a, b a a\}$. Which of the following strings are not in $\text{L}^{*}$.$\mathrm{abaabaaabaa}$$\mathrm{aaaabaaaa}$$\mathrm{baaaaabaaaab}$$\mathrm{baa...

Let $\text{A}=\{a, b\}$ and $\text{L}=\text{A}^{*}$. Let $x=\left\{a^{n} b^{n}, n>0\right\}$. The languages $\text{L} \cup \text{X}$ and $\text{X}$ are respectively :Not ...