List questions from automata

Published on 22 Apr 2022 - 17:50

155

Views

What does it mean for a language to be sparse?

Published on 30 Mar 2026 - 6:14

203

Views

On the general relationship between automata, expressions, and grammars

Published on 29 Mar 2026 - 22:13

132

Views

Designing DFA module 2,3

Published on 26 May 2022 - 9:28

480

Views

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

Published on 29 Mar 2026 - 22:07

1.1k

Views

My proof of $\{a^p|p\mathbb{isprime}\}$ is not a CFL.

Published on 25 Mar 2026 - 21:49

361

Views

Does a minimal DFA with k states imply that there couldn't exist a NFA with less than k states?

Published on 12 Jun 2022 - 17:47

92

Views

How to prove that a language is not context-free using pumping lemma?

Published on 25 Mar 2026 - 21:47

39

Views

Automata and Formal Languages: Are there also non-regular grammars for regular languages?

Published on 12 Jun 2022 - 21:28

55

Views

$L_1$ and $L_2$ are regular languages. Is $\{ w \in L_1^{|u|} \mid u \in L_2 \}$ regular?

Published on 03 Apr 2026 - 4:25

124

Views

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Published on 25 Mar 2026 - 21:48

40

Views

Solution Verification: Is this language context free? (Building a pushdown automaton).

Published on 24 Feb 2026 - 5:24

75

Views

Question about simulation relations

Published on 20 Jun 2022 - 19:23

39

Views

Prove formal language isn't regular

Published on 28 Mar 2026 - 13:59

109

Views

Prove a subset of a regular language is regular, context-free but not regular or not context free

Published on 26 Mar 2026 - 3:11

List Question

What is a prefix set?

What does it mean for a language to be sparse?

On the general relationship between automata, expressions, and grammars

Designing DFA module 2,3

Proof Attempt: non Context free languages and non regular language with some words added stay non regular/context-free.

My proof of $\{a^p|p\mathbb{isprime}\}$ is not a CFL.

Does a minimal DFA with k states imply that there couldn't exist a NFA with less than k states?

How to prove that a language is not context-free using pumping lemma?

Automata and Formal Languages: Are there also non-regular grammars for regular languages?

$L_1$ and $L_2$ are regular languages. Is $\{ w \in L_1^{|u|} \mid u \in L_2 \}$ regular?

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

Solution Verification: Is this language context free? (Building a pushdown automaton).

Question about simulation relations

Prove formal language isn't regular

Prove a subset of a regular language is regular, context-free but not regular or not context free

Trending Questions

Popular # Hahtags

Popular Questions