Question

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

score 720 · Answer 1 · 2026-03-23 02:37:33

720

Views

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

Published on 23 Mar 2026 - 2:37

score 840 · Answer 2 · 2026-03-17 16:26:16

840

Views

Given a grammar study its type and the language it generates

Published on 17 Mar 2026 - 16:26

score 425 · Answer 3 · 2026-03-22 17:10:58

425

Views

Chomsky–Schützenberger representation theorem in terms of groups

Published on 22 Mar 2026 - 17:10

score 94 · Answer 4 · 2026-03-23 00:20:01

94

Views

Find language generated by a regular grammar

Published on 23 Mar 2026 - 0:20

score 1.2k · Answer 5 · 2026-03-22 22:04:03

1.2k

Views

Foundation of Formal Logic

Published on 22 Mar 2026 - 22:04

score 502 · Answer 6 · 2026-03-25 04:35:16

502

Views

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

Published on 25 Mar 2026 - 4:35

score 44 · Answer 7 · 2026-03-25 01:13:14

44

Views

Stochastic Generative Automaton Optimization

Published on 25 Mar 2026 - 1:13

score 7.4k · Answer 8 · 2026-03-25 06:09:35

7.4k

Views

Show that Turing recognizable languages are closed under intersection.

Published on 25 Mar 2026 - 6:09

score 78 · Answer 9 · 2018-03-01 22:55:58

78

Views

How to distinguish gibberish from legitimate expressions in formal languanges?

Published on 01 Mar 2018 - 22:55

score 64 · Answer 10 · 2018-03-02 22:23:42

64

Views

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

Published on 02 Mar 2018 - 22:23

score 2.1k · Answer 11 · 2026-03-23 23:43:36

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 23 Mar 2026 - 23:43

score 2.2k · Answer 12 · 2026-03-12 12:07:55

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 12 Mar 2026 - 12:07

score 270 · Answer 13 · 2026-03-22 01:11:59

270

Views

Showing a language is decidable

Published on 22 Mar 2026 - 1:11

score 526 · Answer 14 · 2018-03-13 07:13:22

526

Views

Showing the set of DFAs that accept nonempty languages is decidable

Published on 13 Mar 2018 - 7:13

score 506 · Answer 15 · 2026-03-20 05:52:02

506

Views

Flaw in self-referential proof that all languages are undecidable

Published on 20 Mar 2026 - 5:52

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