List questions from regular-language

Published on 17 Mar 2026 - 6:18

440

Views

If a non-empty regular language has k-state NFA recognizing it, it has a string of length at most k

Published on 26 Mar 2026 - 16:57

95

Views

How to check if language transformer function is regular or not?

Published on 26 Mar 2026 - 18:30

122

Views

Given $f(A) = \{ac \mid abc \in A \ and \ |a| = |b| = |c|\}$, why is $f(L)$ not regular if $L$ is a regular language?

Published on 26 Mar 2026 - 18:40

965

Views

DFA for all strings avoiding 'aa'

Published on 25 Mar 2026 - 20:39

224

Views

Prove that Ɛ(S) = Ɛ(Ɛ(S))

Published on 26 Mar 2026 - 18:30

2k

Views

How to prove that the class of regular languages is closed under a homomorphism.

Published on 25 Mar 2026 - 23:38

173

Views

Find language generated by a grammar

Published on 31 Oct 2019 - 1:35

1.4k

Views

Create a Context free Grammar that generates all strings in Σ*

Published on 25 Mar 2026 - 17:38

57

Views

Finding regular expressions.

Published on 25 Mar 2026 - 20:40

83

Views

Pumping Lemma - Grammar - Regular language

Published on 25 Mar 2026 - 4:35

29

Views

Prove, that $L:=\{w\cdot d\cdot \overleftarrow{w}\mid w\in \{a,b\}^+\}$ is not regular using the pumping-lemma

Published on 25 Mar 2026 - 4:41

47

Views

How can I show regular language is closed under square root?

Published on 17 Mar 2026 - 15:40

92

Views

Find, if possible, a finite automaton that recognizes $L(G) = 0^(1022^ + 2(00)^*)$

Published on 25 Mar 2026 - 19:05

323

Views

Is the infinite union of regular languages context free?

Published on 25 Mar 2026 - 19:04

List Question

Regular Language accepted by a Finite State Machine

If a non-empty regular language has k-state NFA recognizing it, it has a string of length at most k

How to check if language transformer function is regular or not?

Given $f(A) = \{ac \mid abc \in A \ and \ |a| = |b| = |c|\}$, why is $f(L)$ not regular if $L$ is a regular language?

DFA for all strings avoiding 'aa'

Prove that Ɛ(S) = Ɛ(Ɛ(S))

How to prove that the class of regular languages is closed under a homomorphism.

Find language generated by a grammar

Create a Context free Grammar that generates all strings in Σ*

Finding regular expressions.

Pumping Lemma - Grammar - Regular language

Prove, that $L:=\{w\cdot d\cdot \overleftarrow{w}\mid w\in \{a,b\}^+\}$ is not regular using the pumping-lemma

How can I show regular language is closed under square root?

Find, if possible, a finite automaton that recognizes $L(G) = 0^(1022^ + 2(00)^*)$

Is the infinite union of regular languages context free?

Trending Questions

Popular # Hahtags

Popular Questions