Question

Significance of reflexive and transitive closure in String, Language & CFG

score 730 · Answer 1 · 2026-04-29 12:46:03

730

Views

Significance of reflexive and transitive closure in String, Language & CFG

Published on 29 Apr 2026 - 12:46

score 847 · Answer 2 · 2026-05-07 01:57:11

847

Views

Given a grammar study its type and the language it generates

Published on 07 May 2026 - 1:57

score 434 · Answer 3 · 2026-04-29 12:46:14

434

Views

Chomsky–Schützenberger representation theorem in terms of groups

Published on 29 Apr 2026 - 12:46

score 104 · Answer 4 · 2026-04-29 12:46:02

104

Views

Find language generated by a regular grammar

Published on 29 Apr 2026 - 12:46

score 1.2k · Answer 5 · 2026-04-25 04:52:49

1.2k

Views

Foundation of Formal Logic

Published on 25 Apr 2026 - 4:52

score 507 · Answer 6 · 2026-05-10 12:51:08

507

Views

$|L^k| = |L|^k$?

Published on 10 May 2026 - 12:51

score 46 · Answer 7 · 2026-04-10 23:24:49

46

Views

Stochastic Generative Automaton Optimization

Published on 10 Apr 2026 - 23:24

score 7.4k · Answer 8 · 2026-05-10 13:45:55

7.4k

Views

Show that Turing recognizable languages are closed under intersection.

Published on 10 May 2026 - 13:45

score 81 · Answer 9 · 2026-04-14 13:14:50

81

Views

How to distinguish gibberish from legitimate expressions in formal languanges?

Published on 14 Apr 2026 - 13:14

score 67 · Answer 10 · 2026-04-11 09:32:22

67

Views

Is the language $\{\langle A\rangle\mid A\text{ is an NFA and }L(A) = \{0, 1\}^*\}$ decidable?

Published on 11 Apr 2026 - 9:32

score 2.1k · Answer 11 · 2026-05-10 12:53:45

2.1k

Views

$L_1$ is a regular language, $L_2$ is a non-regular language, the intersection $L_1 \cap L_2$ is finite language

Published on 10 May 2026 - 12:53

score 2.2k · Answer 12 · 2026-04-15 08:15:12

2.2k

Views

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

Published on 15 Apr 2026 - 8:15

score 274 · Answer 13 · 2026-04-11 13:27:47

274

Views

Showing a language is decidable

Published on 11 Apr 2026 - 13:27

score 528 · Answer 14 · 2026-04-16 11:39:00

528

Views

Showing the set of DFAs that accept nonempty languages is decidable

Published on 16 Apr 2026 - 11:39

score 513 · Answer 15 · 2026-04-29 12:19:45

513

Views

Flaw in self-referential proof that all languages are undecidable

Published on 29 Apr 2026 - 12:19

List Question

Significance of reflexive and transitive closure in String, Language & CFG

Given a grammar study its type and the language it generates

Chomsky–Schützenberger representation theorem in terms of groups

Find language generated by a regular grammar

Foundation of Formal Logic

$|L^k| = |L|^k$?

Stochastic Generative Automaton Optimization

Show that Turing recognizable languages are closed under intersection.

How to distinguish gibberish from legitimate expressions in formal languanges?

Is the language $\{\langle A\rangle\mid A\text{ is an NFA and }L(A) = \{0, 1\}^*\}$ decidable?

$L_1$ is a regular language, $L_2$ is a non-regular language, the intersection $L_1 \cap L_2$ is finite language

Show that single-tape TMs that cannot write on the portion of the tape containing the input string recognizes only regular languages.

Showing a language is decidable

Showing the set of DFAs that accept nonempty languages is decidable

Flaw in self-referential proof that all languages are undecidable

Trending Questions

Popular # Hahtags

Popular Questions