Question

Finite automaton that recognizes the empty language $\emptyset$

score 42.9k · Answer 1 · 2026-04-04 05:58:12

42.9k

Views

Finite automaton that recognizes the empty language $\emptyset$

Published on 04 Apr 2026 - 5:58

score 1.9k · Answer 2 · 2026-04-02 09:51:43

1.9k

Views

Regular expression for strings with length not a multiple of 10

Published on 02 Apr 2026 - 9:51

score 34 · Answer 3 · 2026-04-05 19:38:52

34

Views

if $\ L_{1} \cup L_{2}$ is regular and $\ L_{1} \cap L_{2}$ is regular, and $\ L_{2}$ is regular, so $\ L_{1}$ is regular.

Published on 05 Apr 2026 - 19:38

score 143 · Answer 4 · 2020-08-08 13:26:43

143

Views

The math of password policy anti-patterns

Published on 08 Aug 2020 - 13:26

score 1k · Answer 5 · 2026-02-23 19:15:20

1k

Views

Decidable Languages over an alphabet

Published on 23 Feb 2026 - 19:15

score 316 · Answer 6 · 2020-08-21 10:50:42

316

Views

When proving statements on a logical system, do we use intuitive "meta" logic, or do we use the deduction rules from the system?

Published on 21 Aug 2020 - 10:50

score 197 · Answer 7 · 2026-03-26 01:17:55

197

Views

What is the connection between the language (of some formal grammar) and algebra on the words of this language?

Published on 26 Mar 2026 - 1:17

score 414 · Answer 8 · 2020-09-05 08:13:13

414

Views

Backus Normal Form and Logic

Published on 05 Sep 2020 - 8:13

score 1.1k · Answer 9 · 2026-03-26 14:43:02

1.1k

Views

In what sense is $\sf ZFC$ "stronger" than Peano arithmetic?

Published on 26 Mar 2026 - 14:43

score 168 · Answer 10 · 2026-03-28 18:12:53

168

Views

Lambda Calculus change of variable

Published on 28 Mar 2026 - 18:12

score 59 · Answer 11 · 2020-09-13 19:16:58

59

Views

Count the repetitions of the elements of a list

Published on 13 Sep 2020 - 19:16

score 234 · Answer 12 · 2020-09-13 22:33:31

234

Views

1.3.1 Exercises 1. in A Friendly Introduction to Mathematical Logic

Published on 13 Sep 2020 - 22:33

score 91 · Answer 13 · 2020-09-14 01:01:46

91

Views

Show that, for any languages $L_1$ and $L_2$, we have (1). $L_1L_1^* = L_1^L_1L_1^$

Published on 14 Sep 2020 - 1:01

score 107 · Answer 14 · 2026-03-31 19:15:02

107

Views

Are the uses of "language" in universal algebra and in formal languages related?

Published on 31 Mar 2026 - 19:15

score 609 · Answer 15 · 2026-04-02 22:59:32

609

Views

Finding Free and Bound Variables

Published on 02 Apr 2026 - 22:59

List Question

Finite automaton that recognizes the empty language $\emptyset$

Regular expression for strings with length not a multiple of 10

if $\ L_{1} \cup L_{2}$ is regular and $\ L_{1} \cap L_{2}$ is regular, and $\ L_{2}$ is regular, so $\ L_{1}$ is regular.

The math of password policy anti-patterns

Decidable Languages over an alphabet

When proving statements on a logical system, do we use intuitive "meta" logic, or do we use the deduction rules from the system?

What is the connection between the language (of some formal grammar) and algebra on the words of this language?

Backus Normal Form and Logic

In what sense is $\sf ZFC$ "stronger" than Peano arithmetic?

Lambda Calculus change of variable

Count the repetitions of the elements of a list

1.3.1 Exercises 1. in A Friendly Introduction to Mathematical Logic

Show that, for any languages $L_1$ and $L_2$, we have (1). $L_1L_1^* = L_1^L_1L_1^$

Are the uses of "language" in universal algebra and in formal languages related?

Finding Free and Bound Variables

Trending Questions

Popular # Hahtags

Popular Questions