List questions from regular-language

Published on 27 Mar 2026 - 10:10

88

Views

Using the pumping lemma to deduce that the language consisting of palindromes is not regular

Published on 25 Mar 2026 - 6:05

1.1k

Views

Regular expression that accept the language of all binary strings with exactly two $a$’s and at least one $b$.

Published on 26 Mar 2026 - 4:51

1.5k

Views

What does w ∈ a, b* mean?

Published on 25 Mar 2026 - 7:47

164

Views

Determine if complement of non-regular language is context-free

Published on 26 Mar 2026 - 2:54

1.7k

Views

There exists a regular language A such that for all languages B, A ∩ B is regular.

Published on 16 Jul 2016 - 14:16

299

Views

Is Predicate Logic a Regular Language?

Published on 28 Jul 2016 - 18:29

62

Views

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

Published on 26 Mar 2026 - 2:57

104

Views

CFG and Regularity of Two Language?

Published on 27 Mar 2026 - 10:11

255

Views

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Published on 26 Mar 2026 - 4:36

2.6k

Views

Is there any language that $\bar L^= (\bar L)^$?

Published on 25 Mar 2026 - 9:38

4.5k

Views

Regular expression that contains no aab-substring

Published on 26 Mar 2026 - 6:26

873

Views

Regular Expression even length at least aaaa-substring

Published on 26 Mar 2026 - 6:26

94

Views

Proof that language isn't accepted by a FDA

Published on 25 Mar 2026 - 9:25

516

Views

Can a context-sensitive grammar have an empty string?

Published on 26 Mar 2026 - 4:29

List Question

Do DFA's with outputs not have a set of final states?

Using the pumping lemma to deduce that the language consisting of palindromes is not regular

Regular expression that accept the language of all binary strings with exactly two $a$’s and at least one $b$.

What does w ∈ a, b* mean?

Determine if complement of non-regular language is context-free

There exists a regular language A such that for all languages B, A ∩ B is regular.

Is Predicate Logic a Regular Language?

Construct a grammar for $L=\{a^k b^l \ldots a^k b^l : k\geq 2 , l\geq 1\text{ and }a^k b^l \text{ is repeated at least once}\}$

CFG and Regularity of Two Language?

Does the fact that $L_1L_2$ and $L_2L_1$ are both regular imply that at least one between $L_1$ and $L_2$ is regular?

Is there any language that $\bar L^= (\bar L)^$?

Regular expression that contains no aab-substring

Regular Expression even length at least aaaa-substring

Proof that language isn't accepted by a FDA

Can a context-sensitive grammar have an empty string?

Trending Questions

Popular # Hahtags

Popular Questions