Question

Questions about expressing each of the following statements in formal language and negating each of them respectively

score 50 · Answer 1 · 2021-03-05 16:42:30

50

Views

Questions about expressing each of the following statements in formal language and negating each of them respectively

Published on 05 Mar 2021 - 16:42

score 37 · Answer 2 · 2026-02-24 05:22:53

37

Views

Create PDA for Language

Published on 24 Feb 2026 - 5:22

score 37 · Answer 3 · 2026-04-02 16:31:07

37

Views

Show that $A=\{0^m 1^n |\text{ }m\text{ is even or }m > n\}$ has infinitely many equivalence classes to prove non-regularity.

Published on 02 Apr 2026 - 16:31

score 34 · Answer 4 · 2026-04-02 16:38:06

34

Views

Show that $A=\{0^k 1^m 0^n |\text{ }n=k+m\}$ has infinitely many equivalence classes.

Published on 02 Apr 2026 - 16:38

score 1.4k · Answer 5 · 2026-03-29 19:49:09

1.4k

Views

Prove that the set of Turing-decidable languages are closed under union.

Published on 29 Mar 2026 - 19:49

score 663 · Answer 6 · 2026-03-29 19:52:40

663

Views

Prove that the set of Turing-decidable languages are closed under reversal.

Published on 29 Mar 2026 - 19:52

score 40 · Answer 7 · 2021-03-13 20:42:02

40

Views

Do Dyck Words or Dyck Paths Have Manifestations in Nature?

Published on 13 Mar 2021 - 20:42

score 50 · Answer 8 · 2021-03-14 16:07:57

50

Views

Proving that there is a sequence of letters in all words of a formal language

Published on 14 Mar 2021 - 16:07

score 57 · Answer 9 · 2021-03-15 00:50:40

57

Views

Are we implicitly introducing functional predicates in our daily use of math?

Published on 15 Mar 2021 - 0:50

score 247 · Answer 10 · 2021-03-15 18:01:29

247

Views

Give a non-recursive definition for the language L

Published on 15 Mar 2021 - 18:01

score 124 · Answer 11 · 2026-04-02 16:30:49

124

Views

$L^2$ = $L$ equality implications for a formal language

Published on 02 Apr 2026 - 16:30

score 88 · Answer 12 · 2026-04-04 19:14:49

88

Views

What is the relationship between the language accepted by DFA $M_1$ and the language accepted by DFA $M$?

Published on 04 Apr 2026 - 19:14

score 83 · Answer 13 · 2026-04-02 16:32:20

83

Views

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Published on 02 Apr 2026 - 16:32

score 64 · Answer 14 · 2026-04-04 23:21:25

64

Views

Design automata for these languages

Published on 04 Apr 2026 - 23:21

score 444 · Answer 15 · 2026-03-29 19:51:25

444

Views

Determining whether a language $L_{a}$ is recursively enumerable.

Published on 29 Mar 2026 - 19:51

List Question

Questions about expressing each of the following statements in formal language and negating each of them respectively

Create PDA for Language

Show that $A=\{0^m 1^n |\text{ }m\text{ is even or }m > n\}$ has infinitely many equivalence classes to prove non-regularity.

Show that $A=\{0^k 1^m 0^n |\text{ }n=k+m\}$ has infinitely many equivalence classes.

Prove that the set of Turing-decidable languages are closed under union.

Prove that the set of Turing-decidable languages are closed under reversal.

Do Dyck Words or Dyck Paths Have Manifestations in Nature?

Proving that there is a sequence of letters in all words of a formal language

Are we implicitly introducing functional predicates in our daily use of math?

Give a non-recursive definition for the language L

$L^2$ = $L$ equality implications for a formal language

What is the relationship between the language accepted by DFA $M_1$ and the language accepted by DFA $M$?

What's the purpose of the word $w$ in the proof for $ L \in \mathsf{REG} \implies L(\varphi) \in \mathsf{MSO}$ with $L(\varphi) = L$?

Design automata for these languages

Determining whether a language $L_{a}$ is recursively enumerable.

Trending Questions

Popular # Hahtags

Popular Questions