Question

For any language $L_1$ and $L_2$ if $L_1 \subseteq L_2$, then ${L_1}^* \subseteq {L_2}^*$

score 88 · Answer 1 · 2017-09-03 22:34:37

88

Views

For any language $L_1$ and $L_2$ if $L_1 \subseteq L_2$, then ${L_1}^* \subseteq {L_2}^*$

Published on 03 Sep 2017 - 22:34

score 1.1k · Answer 2 · 2026-03-29 04:48:00

1.1k

Views

Number of Turing machines

Published on 29 Mar 2026 - 4:48

score 2.4k · Answer 3 · 2026-03-26 17:12:04

2.4k

Views

how to reduce DFA to NFA with less states

Published on 26 Mar 2026 - 17:12

score 123 · Answer 4 · 2026-03-26 17:13:21

123

Views

What is the DFA for this NFA

Published on 26 Mar 2026 - 17:13

score 493 · Answer 5 · 2026-03-29 06:30:33

493

Views

Why are Turing Machines the Preferred Model of Computation?

Published on 29 Mar 2026 - 6:30

score 41 · Answer 6 · 2026-03-28 14:44:31

41

Views

Find the grammar and the language that is generated $L=L_1 - {L_4}^c$

Published on 28 Mar 2026 - 14:44

score 116 · Answer 7 · 2026-03-26 17:13:25

116

Views

What is the DFA for this language?

Published on 26 Mar 2026 - 17:13

score 71 · Answer 8 · 2026-03-28 14:44:06

71

Views

Given $L_1 =\{w: |w| \bmod 3 >0\}$ and $L_2 =\{w: |w| \bmod 5 =0\}$,. What is $L=L_1 \cap L_2$ and the grammar it produces?

Published on 28 Mar 2026 - 14:44

score 99 · Answer 9 · 2017-09-15 15:29:59

99

Views

Given $\sum =\{a,b\}$ , give some example of strings in, and not in these sets where: $\{w\mid: ww=www\}$

Published on 15 Sep 2017 - 15:29

score 602 · Answer 10 · 2026-03-26 17:13:25

602

Views

Language recognized by Finite automata?

Published on 26 Mar 2026 - 17:13

score 521 · Answer 11 · 2017-09-23 14:15:41

521

Views

Prove any DFA with $k<2^n$ states does not accept the strings with an odd number of some character.

Published on 23 Sep 2017 - 14:15

score 1.8k · Answer 12 · 2026-03-29 06:30:07

1.8k

Views

A Turing machine which computes $x^y$

Published on 29 Mar 2026 - 6:30

score 343 · Answer 13 · 2026-03-29 06:30:20

343

Views

Correlated halting of two Turing Machines

Published on 29 Mar 2026 - 6:30

score 3.4k · Answer 14 · 2017-09-30 06:33:36

3.4k

Views

Dfa accepting all strings with odd number of 0's and odd number of 1's

Published on 30 Sep 2017 - 6:33

score 3.3k · Answer 15 · 2026-03-29 06:30:19

3.3k

Views

Design a Turing machine which computes the sum of two numbers in base $2$

Published on 29 Mar 2026 - 6:30

List Question

For any language $L_1$ and $L_2$ if $L_1 \subseteq L_2$, then ${L_1}^* \subseteq {L_2}^*$

Number of Turing machines

how to reduce DFA to NFA with less states

What is the DFA for this NFA

Why are Turing Machines the Preferred Model of Computation?

Find the grammar and the language that is generated $L=L_1 - {L_4}^c$

What is the DFA for this language?

Given $L_1 =\{w: |w| \bmod 3 >0\}$ and $L_2 =\{w: |w| \bmod 5 =0\}$,. What is $L=L_1 \cap L_2$ and the grammar it produces?

Given $\sum =\{a,b\}$ , give some example of strings in, and not in these sets where: $\{w\mid: ww=www\}$

Language recognized by Finite automata?

Prove any DFA with $k<2^n$ states does not accept the strings with an odd number of some character.

A Turing machine which computes $x^y$

Correlated halting of two Turing Machines

Dfa accepting all strings with odd number of 0's and odd number of 1's

Design a Turing machine which computes the sum of two numbers in base $2$

Trending Questions

Popular # Hahtags

Popular Questions