Question

Turing machine with read only part and finite tape

score 773 · Answer 1 · 2026-04-10 16:44:49

773

Views

Turing machine with read only part and finite tape

Published on 10 Apr 2026 - 16:44

score 104 · Answer 2 · 2026-04-15 20:27:27

104

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 15 Apr 2026 - 20:27

score 76 · Answer 3 · 2026-04-17 06:30:54

76

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 17 Apr 2026 - 6:30

score 69 · Answer 4 · 2026-04-16 19:12:55

69

Views

Finding languages such that L1⊆L2⊆L3 where L1,L3∉ RE and L2∈ R

Published on 16 Apr 2026 - 19:12

score 235 · Answer 5 · 2026-04-16 17:36:13

235

Views

Try finding languages such that L1⊆L2⊆L3 where L1,L3∉ RE and L2∈ R

Published on 16 Apr 2026 - 17:36

score 590 · Answer 6 · 2026-04-14 16:29:08

590

Views

Design DFA to check even number of 1s using 2 states.

Published on 14 Apr 2026 - 16:29

score 77 · Answer 7 · 2026-05-10 13:57:40

77

Views

Language of this finite state automaton?

Published on 10 May 2026 - 13:57

score 101 · Answer 8 · 2026-05-11 00:03:09

101

Views

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

Published on 11 May 2026 - 0:03

score 1k · Answer 9 · 2026-04-15 09:33:46

1k

Views

Create NFA where the second symbol of the string is the same with the last symbol

Published on 15 Apr 2026 - 9:33

score 300 · Answer 10 · 2026-04-13 22:38:13

300

Views

Give a state diagram for an NFA whose language L = ...

Published on 13 Apr 2026 - 22:38

score 497 · Answer 11 · 2026-05-10 14:04:41

497

Views

context free language prove or disprove

Published on 10 May 2026 - 14:04

score 263 · Answer 12 · 2026-04-09 05:52:53

263

Views

Open problems in Cellular Automata field

Published on 09 Apr 2026 - 5:52

score 96 · Answer 13 · 2026-04-16 09:27:33

96

Views

DFM symbol a occurs twice

Published on 16 Apr 2026 - 9:27

score 381 · Answer 14 · 2026-04-14 13:21:07

381

Views

Does the empty string share properties of both zero and $\emptyset$?

Published on 14 Apr 2026 - 13:21

score 219 · Answer 15 · 2026-05-10 11:06:14

219

Views

Gcd is a Regular Language

Published on 10 May 2026 - 11:06

List Question

Turing machine with read only part and finite tape

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

Finding languages such that L1⊆L2⊆L3 where L1,L3∉ RE and L2∈ R

Try finding languages such that L1⊆L2⊆L3 where L1,L3∉ RE and L2∈ R

Design DFA to check even number of 1s using 2 states.

Language of this finite state automaton?

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

Create NFA where the second symbol of the string is the same with the last symbol

Give a state diagram for an NFA whose language L = ...

context free language prove or disprove

Open problems in Cellular Automata field

DFM symbol a occurs twice

Does the empty string share properties of both zero and $\emptyset$?

Gcd is a Regular Language

Trending Questions

Popular # Hahtags

Popular Questions