Question

Turing machine with read only part and finite tape

score 770 · Answer 1 · 2018-12-30 17:51:43

770

Views

Turing machine with read only part and finite tape

Published on 30 Dec 2018 - 17:51

score 101 · Answer 2 · 2019-01-08 23:47:04

101

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 08 Jan 2019 - 23:47

score 73 · Answer 3 · 2019-01-09 17:39:09

73

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 09 Jan 2019 - 17:39

score 66 · Answer 4 · 2019-01-10 15:22:32

66

Views

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

Published on 10 Jan 2019 - 15:22

score 232 · Answer 5 · 2019-01-10 20:02:54

232

Views

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

Published on 10 Jan 2019 - 20:02

score 587 · Answer 6 · 2019-01-13 06:57:07

587

Views

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

Published on 13 Jan 2019 - 6:57

score 71 · Answer 7 · 2026-03-22 21:54:02

71

Views

Language of this finite state automaton?

Published on 22 Mar 2026 - 21:54

score 97 · Answer 8 · 2026-03-25 04:37:45

97

Views

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

Published on 25 Mar 2026 - 4:37

score 1k · Answer 9 · 2019-01-29 13:58:04

1k

Views

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

Published on 29 Jan 2019 - 13:58

score 297 · Answer 10 · 2019-02-02 02:26:44

297

Views

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

Published on 02 Feb 2019 - 2:26

score 491 · Answer 11 · 2026-03-25 01:22:32

491

Views

context free language prove or disprove

Published on 25 Mar 2026 - 1:22

score 261 · Answer 12 · 2026-03-25 12:42:49

261

Views

Open problems in Cellular Automata field

Published on 25 Mar 2026 - 12:42

score 93 · Answer 13 · 2019-02-12 18:11:56

93

Views

DFM symbol a occurs twice

Published on 12 Feb 2019 - 18:11

score 378 · Answer 14 · 2019-02-18 01:28:22

378

Views

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

Published on 18 Feb 2019 - 1:28

score 213 · Answer 15 · 2019-02-18 06:50:17

213

Views

Gcd is a Regular Language

Published on 18 Feb 2019 - 6:50

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