List questions from regular-language

Published on 27 Mar 2026 - 3:57

84

Views

Prove $(L^)^=L^*$

Published on 26 Mar 2026 - 3:11

815

Views

Are regular expressions sets?

Published on 26 Mar 2026 - 3:09

1k

Views

Showing that the language of prefixes $\operatorname{pre}\mathcal L$ is regular by using the definition of a regular language

Published on 26 Mar 2026 - 4:53

470

Views

Defining prefixes for regular expressions

Published on 26 Mar 2026 - 3:10

377

Views

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Published on 25 Mar 2026 - 4:40

35

Views

Power of a group of languages

Published on 25 Mar 2026 - 22:04

213

Views

How to prove that a language is not regular without the use of the Pumping Lemma?

Published on 25 Mar 2026 - 4:40

34

Views

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Published on 25 Mar 2026 - 22:04

515

Views

Prove that if L is decidable then half(L) is decidable too

Published on 23 Feb 2026 - 6:42

685

Views

Why is the minimal pumping length for $(01)^*$ equal to 1?

Published on 25 Mar 2026 - 6:02

1.2k

Views

Prove that a class of regular languages is closed under an operation

Published on 10 Apr 2020 - 17:51

88

Views

How do these languages intersect the way they do?

Published on 19 Apr 2020 - 15:05

288

Views

union of regular language and non regular language

Published on 27 Mar 2026 - 7:13

825

Views

pumping lemma - union of regular languages

Published on 25 Mar 2026 - 6:01

List Question

Why is $a^nb^n$ irregular but $a^b^$ regular?

Prove $(L^)^=L^*$

Are regular expressions sets?

Showing that the language of prefixes $\operatorname{pre}\mathcal L$ is regular by using the definition of a regular language

Defining prefixes for regular expressions

What is the difference between pumping Lemma for regualar languages and pumping lemma for context free languages?

Power of a group of languages

How to prove that a language is not regular without the use of the Pumping Lemma?

Using induction to show that the languages $\mathcal L(A)$ and $\mathcal L(G(A))$ are the same

Prove that if L is decidable then half(L) is decidable too

Why is the minimal pumping length for $(01)^*$ equal to 1?

Prove that a class of regular languages is closed under an operation

How do these languages intersect the way they do?

union of regular language and non regular language

pumping lemma - union of regular languages

Trending Questions

Popular # Hahtags

Popular Questions