Question

Is this set recursively enumerable, recursive and semantically closed?

score 91 · Answer 1 · 2026-04-03 09:27:37

91

Views

Is this set recursively enumerable, recursive and semantically closed?

Published on 03 Apr 2026 - 9:27

score 55 · Answer 2 · 2017-09-02 02:31:34

55

Views

How to formally define this language?

Published on 02 Sep 2017 - 2:31

score 238 · Answer 3 · 2026-04-03 05:51:32

238

Views

For some alphabet $\sum = \{a,b\}$ what is the concatenation $\sum\sum$?

Published on 03 Apr 2026 - 5:51

score 89 · Answer 4 · 2026-04-03 07:12:19

89

Views

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

Published on 03 Apr 2026 - 7:12

score 1.1k · Answer 5 · 2026-03-26 17:14:00

1.1k

Views

Define a DFA to recognize the language $\mathcal L = \{a^i b^j : (i + j) \pmod 3 = 0\}$.

Published on 26 Mar 2026 - 17:14

score 2.4k · Answer 6 · 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 7 · 2026-03-26 17:13:21

123

Views

What is the DFA for this NFA

Published on 26 Mar 2026 - 17:13

score 41 · Answer 8 · 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 32 · Answer 9 · 2026-03-29 22:33:02

32

Views

Name of an operation that joins words into phrases

Published on 29 Mar 2026 - 22:33

score 124 · Answer 10 · 2017-09-14 16:14:42

124

Views

A rigorous definition of the intuitive concept of the PEMDAS language.

Published on 14 Sep 2017 - 16:14

score 116 · Answer 11 · 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 12 · 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 100 · Answer 13 · 2026-04-03 07:12:13

100

Views

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

Published on 03 Apr 2026 - 7:12

score 52 · Answer 14 · 2017-09-16 04:04:06

52

Views

Juxtaposed infinite letter sequences.

Published on 16 Sep 2017 - 4:04

score 651 · Answer 15 · 2017-09-16 15:46:52

651

Views

Kleene Star Multiplication Proof Verification

Published on 16 Sep 2017 - 15:46

List Question

Is this set recursively enumerable, recursive and semantically closed?

How to formally define this language?

For some alphabet $\sum = \{a,b\}$ what is the concatenation $\sum\sum$?

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

Define a DFA to recognize the language $\mathcal L = \{a^i b^j : (i + j) \pmod 3 = 0\}$.

how to reduce DFA to NFA with less states

What is the DFA for this NFA

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

Name of an operation that joins words into phrases

A rigorous definition of the intuitive concept of the PEMDAS language.

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\}$

Juxtaposed infinite letter sequences.

Kleene Star Multiplication Proof Verification

Trending Questions

Popular # Hahtags

Popular Questions