List questions from regular-language

Published on 10 May 2026 - 14:07

110

Views

$L_n = \{x \in \Sigma^{} | \exists w, y, z \in \Sigma^, x = ywz, w^r = w, |w| = n \}$ where x is palindrome of length n, find regex for $n = 1$.

Published on 10 May 2026 - 12:35

71

Views

'$L$ almost' is regular

Published on 30 Apr 2026 - 13:31

137

Views

Show that the following language is context-free/not context free by expressing the language as the union of three other languages.

Published on 10 May 2026 - 15:10

96

Views

Is there a metric with wildcard?

Published on 10 May 2026 - 15:12

183

Views

How to prove that $L=\{w\in\{0,1,2\}^*|\#_2(w)<\#_0(w)\}$ is not regular using Myhill–Nerode theorem?

Published on 12 Apr 2026 - 6:37

37

Views

Prove using the Pumping Lemma

Published on 10 May 2026 - 14:02

1.1k

Views

Left Linear Grammer to Right Linear Grammer

Published on 10 May 2026 - 15:12

32

Views

Identify the Nature of the given Language

Published on 14 Apr 2026 - 17:58

56

Views

How can I prove given language is not regular?

Published on 09 Apr 2026 - 11:35

1.3k

Views

regular language equality prove by induction

Published on 14 Apr 2026 - 13:56

798

Views

Given a transition table do digraph, determine if it is DFA or NFA and build grammar

Published on 10 Apr 2026 - 19:25

139

Views

number of words in language $L \subset \Sigma$

Published on 10 May 2026 - 16:20

99

Views

If a language and its complement are context-free, is it regular?

Published on 14 Apr 2026 - 18:45

56

Views

Context-Free grammar - Normal form

Published on 10 May 2026 - 17:08

List Question

How to determine the beginning of $uv^iw$ in the pumping lemma for regular languages?

$L_n = \{x \in \Sigma^{} | \exists w, y, z \in \Sigma^, x = ywz, w^r = w, |w| = n \}$ where x is palindrome of length n, find regex for $n = 1$.

'$L$ almost' is regular

Show that the following language is context-free/not context free by expressing the language as the union of three other languages.

Is there a metric with wildcard?

How to prove that $L=\{w\in\{0,1,2\}^*|\#_2(w)<\#_0(w)\}$ is not regular using Myhill–Nerode theorem?

Prove using the Pumping Lemma

Left Linear Grammer to Right Linear Grammer

Identify the Nature of the given Language

How can I prove given language is not regular?

regular language equality prove by induction

Given a transition table do digraph, determine if it is DFA or NFA and build grammar

number of words in language $L \subset \Sigma$

If a language and its complement are context-free, is it regular?

Context-Free grammar - Normal form

Trending Questions

Popular # Hahtags

Popular Questions