Question

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

score 479 · Answer 1 · 2026-03-27 00:10:11

479

Views

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Published on 27 Mar 2026 - 0:10

score 280 · Answer 2 · 2020-01-21 22:08:12

280

Views

Is there a canonical "algebra of strings"?

Published on 21 Jan 2020 - 22:08

score 161 · Answer 3 · 2026-03-25 09:37:02

161

Views

Modifying the formal grammar of first-order logic

Published on 25 Mar 2026 - 9:37

score 2k · Answer 4 · 2026-03-26 09:16:45

2k

Views

Constructing Turing machine for $L=\{a^n b^m, m\%n=0\}$

Published on 26 Mar 2026 - 9:16

score 135 · Answer 5 · 2026-03-27 10:57:06

135

Views

Calculi for the category theory?

Published on 27 Mar 2026 - 10:57

score 204 · Answer 6 · 2026-03-25 09:24:29

204

Views

Existence of thin bases

Published on 25 Mar 2026 - 9:24

score 36 · Answer 7 · 2020-01-27 20:14:36

36

Views

Is checking if algorithm that solves NP problem running in polynomial time NP problem itself?

Published on 27 Jan 2020 - 20:14

score 63 · Answer 8 · 2026-03-26 12:35:38

63

Views

Construction of formal systems and generative procedures in a meta-theory

Published on 26 Mar 2026 - 12:35

score 59 · Answer 9 · 2026-03-25 09:22:36

59

Views

Finite concatenation-free languages

Published on 25 Mar 2026 - 9:22

score 371 · Answer 10 · 2020-01-28 19:09:21

371

Views

What is the formal definition of 'string'?

Published on 28 Jan 2020 - 19:09

score 202 · Answer 11 · 2026-03-27 00:09:33

202

Views

Proving that if $C$ is a prefix code then it is uniquely decipherable?

Published on 27 Mar 2026 - 0:09

score 512 · Answer 12 · 2026-03-25 09:39:57

512

Views

Is this language regular? $L = \{ xyyz \in \{0,1 \}^* \colon x,z \in \{0,1 \}^*, y \in \{0, 1\}^+\}$

Published on 25 Mar 2026 - 9:39

score 78 · Answer 13 · 2026-03-25 09:40:03

78

Views

What kind of language is $\{\text{bin}(n)\text{oct}(n)^R \colon n \in \mathbb{N} \}$? Regular? Context-free? Neither? Prove.

Published on 25 Mar 2026 - 9:40

score 200 · Answer 14 · 2026-03-25 23:39:23

200

Views

Is $L$ regular? context free but not regular? Neither? $L = \{ xwx : x,w \in \{a,b,c \}^*, |x| > 0\}$

Published on 25 Mar 2026 - 23:39

score 38 · Answer 15 · 2020-02-02 21:34:17

38

Views

“$P$ is true” is true

Published on 02 Feb 2020 - 21:34

List Question

T or F: The subset of a regular set over {a, b, c} consisting of just those strings that don’t use the symbol c is regular.

Is there a canonical "algebra of strings"?

Modifying the formal grammar of first-order logic

Constructing Turing machine for $L=\{a^n b^m, m\%n=0\}$

Calculi for the category theory?

Existence of thin bases

Is checking if algorithm that solves NP problem running in polynomial time NP problem itself?

Construction of formal systems and generative procedures in a meta-theory

Finite concatenation-free languages

What is the formal definition of 'string'?

Proving that if $C$ is a prefix code then it is uniquely decipherable?

Is this language regular? $L = \{ xyyz \in \{0,1 \}^* \colon x,z \in \{0,1 \}^*, y \in \{0, 1\}^+\}$

What kind of language is $\{\text{bin}(n)\text{oct}(n)^R \colon n \in \mathbb{N} \}$? Regular? Context-free? Neither? Prove.

Is $L$ regular? context free but not regular? Neither? $L = \{ xwx : x,w \in \{a,b,c \}^*, |x| > 0\}$

“$P$ is true” is true

Trending Questions

Popular # Hahtags

Popular Questions