Question

Finding languages such that $L_{1} \subseteq L_{2} \subseteq L_{3}$ where $L_{1}, L_{3} \notin \mathbb{R}$, $L_{2} \in \mathbb{R}$

score 102 · Answer 1 · 2026-03-25 15:43:48

102

Views

Finding languages such that $L_{1} \subseteq L_{2} \subseteq L_{3}$ where $L_{1}, L_{3} \notin \mathbb{R}$, $L_{2} \in \mathbb{R}$

Published on 25 Mar 2026 - 15:43

score 74 · Answer 2 · 2026-03-25 17:20:06

74

Views

Finding languages such that $L_1\subset L_2\subset L_3$ where $L_1,L_3\notin$ RE and $L_2\in$ R

Published on 25 Mar 2026 - 17:20

score 65 · Answer 3 · 2026-03-25 06:05:19

65

Views

How to design a Context-Free Grammar and Pushdown Automaton for the following language

Published on 25 Mar 2026 - 6:05

score 31 · Answer 4 · 2026-03-25 22:09:37

31

Views

Use proven constructions to derive a DFSA.

Published on 25 Mar 2026 - 22:09

score 55 · Answer 5 · 2019-01-20 06:19:52

55

Views

Questions about basic logic (why position of "for all" makes difference)

Published on 20 Jan 2019 - 6:19

score 184 · Answer 6 · 2026-03-25 04:35:59

184

Views

Formal Languages - Context Free Grammar

Published on 25 Mar 2026 - 4:35

score 54 · Answer 7 · 2026-03-25 02:57:54

54

Views

Context-Free grammar - Normal form

Published on 25 Mar 2026 - 2:57

score 108 · Answer 8 · 2026-03-25 01:13:10

108

Views

Pumping Lemma - unregular expression

Published on 25 Mar 2026 - 1:13

score 80 · Answer 9 · 2026-03-25 06:13:05

80

Views

How to disprove that the union of all non-context-free languages over $a$ is also non-context-free language?

Published on 25 Mar 2026 - 6:13

score 56 · Answer 10 · 2019-01-27 18:57:12

56

Views

Give an example of a language $L$ where $\min(\max L)\neq \max(\min L)$

Published on 27 Jan 2019 - 18:57

score 235 · Answer 11 · 2019-01-29 09:43:49

235

Views

What is the right quotient of a language with itself?

Published on 29 Jan 2019 - 9:43

score 622 · Answer 12 · 2019-02-03 19:12:25

622

Views

How to find all the equivalence classes of a given language without using the Table-Filling-Algorithm.

Published on 03 Feb 2019 - 19:12

score 856 · Answer 13 · 2026-03-22 23:58:24

856

Views

Pumping lemma, L={WW^R | W can be {1}+}

Published on 22 Mar 2026 - 23:58

score 385 · Answer 14 · 2019-02-06 00:23:02

385

Views

Proof of A = {0, 1} and B ⊆ {0, 1}*

Published on 06 Feb 2019 - 0:23

score 218 · Answer 15 · 2019-02-07 20:15:40

218

Views

Proving that Every Full Prefix-Free Language is Maximal

Published on 07 Feb 2019 - 20:15

List Question

Finding languages such that $L_{1} \subseteq L_{2} \subseteq L_{3}$ where $L_{1}, L_{3} \notin \mathbb{R}$, $L_{2} \in \mathbb{R}$

Finding languages such that $L_1\subset L_2\subset L_3$ where $L_1,L_3\notin$ RE and $L_2\in$ R

How to design a Context-Free Grammar and Pushdown Automaton for the following language

Use proven constructions to derive a DFSA.

Questions about basic logic (why position of "for all" makes difference)

Formal Languages - Context Free Grammar

Context-Free grammar - Normal form

Pumping Lemma - unregular expression

How to disprove that the union of all non-context-free languages over $a$ is also non-context-free language?

Give an example of a language $L$ where $\min(\max L)\neq \max(\min L)$

What is the right quotient of a language with itself?

How to find all the equivalence classes of a given language without using the Table-Filling-Algorithm.

Pumping lemma, L={WW^R | W can be {1}+}

Proof of A = {0, 1} and B ⊆ {0, 1}*

Proving that Every Full Prefix-Free Language is Maximal

Trending Questions

Popular # Hahtags

Popular Questions