Question

Grammar for a^n

score 76 · Answer 1 · 2024-12-29 03:51:46

76

Views

Grammar for a^n

Published on 29 December 2024 at 03:51

score 90 · Answer 2 · 2024-12-29 04:25:51

90

Views

Is there an algorithm for a compiler compiler that generates a recursive descent parser?

Published on 29 December 2024 at 04:25

score 1.2k · Answer 3 · 2024-12-29 04:00:37

1.2k

Views

Is $E_{LBA}$ a Turing recognizable language?

Published on 29 December 2024 at 04:00

score 2.8k · Answer 4 · 2024-12-29 04:28:02

2.8k

Views

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable

Published on 29 December 2024 at 04:28

score 874 · Answer 5 · 2024-12-29 04:03:25

874

Views

Knuth's bit reversal explanation

Published on 29 December 2024 at 04:03

score 87 · Answer 6 · 2024-12-29 04:10:22

87

Views

How do I determine the big O for my nested for loop?

Published on 29 December 2024 at 04:10

score 661 · Answer 7 · 2024-12-29 03:52:28

661

Views

Nullable nonterminals

Published on 29 December 2024 at 03:52

score 424 · Answer 8 · 2024-12-29 04:08:10

424

Views

YACC: finding shift/reduce conflicts in a grammar

Published on 29 December 2024 at 04:08

score 231 · Answer 9 · 2024-12-29 04:06:16

231

Views

Can this function be simplified (made more "fast")?

Published on 29 December 2024 at 04:06

score 1.3k · Answer 10 · 2024-12-29 04:08:09

1.3k

Views

how to intuitively think while Designing an NFA

Published on 29 December 2024 at 04:08

score 80 · Answer 11 · 2024-12-29 04:10:21

80

Views

Assisstance with comparisons in primitive recursion

Published on 29 December 2024 at 04:10

score 822 · Answer 12 · 2024-12-29 04:24:35

822

Views

Speeding up division and remainder when numerator is a multiple of power of two

Published on 29 December 2024 at 04:24

score 80 · Answer 13 · 2024-12-29 04:10:20

80

Views

Is this a common pattern faced in Computer Science?

Published on 29 December 2024 at 04:10

score 99 · Answer 14 · 2024-12-29 04:19:29

99

Views

Can abstract models for solving NP-hard problems be built in reality?

Published on 29 December 2024 at 04:19

score 5k · Answer 15 · 2024-12-29 04:22:02

5k

Views

How is Turing Machine which accepts nothing is not Recursively Enumerable?

Published on 29 December 2024 at 04:22

score 4k · Answer 16 · 2024-12-29 04:27:10

4k

Views

The VC dimension of hypothesis space H1 is larger than the VC dimension of hypothesis space H2

Published on 29 December 2024 at 04:27

score 5.9k · Answer 17 · 2024-12-29 04:12:32

5.9k

Views

Construct a DFA for the following language: L={a^n b^n | n>=1}

Published on 29 December 2024 at 04:12

score 19.2k · Answer 18 · 2024-12-29 04:21:23

19.2k

Views

Is there a difference between a "finite state machine" and a "state machine"?

Published on 29 December 2024 at 04:21

score 4.5k · Answer 19 · 2024-12-29 03:56:13

4.5k

Views

Minimum number of states needed?

Published on 29 December 2024 at 03:56

score 342 · Answer 20 · 2024-12-29 04:12:31

342

Views

Turing Machine with non trivial states and transitions

Published on 29 December 2024 at 04:12

List Question

Grammar for a^n

Is there an algorithm for a compiler compiler that generates a recursive descent parser?

Is $E_{LBA}$ a Turing recognizable language?

The Set of All Turing Machines is Countable vs the set of all infinite binary sequences is uncountable

Knuth's bit reversal explanation

How do I determine the big O for my nested for loop?

Nullable nonterminals

YACC: finding shift/reduce conflicts in a grammar

Can this function be simplified (made more "fast")?

how to intuitively think while Designing an NFA

Assisstance with comparisons in primitive recursion

Speeding up division and remainder when numerator is a multiple of power of two

Is this a common pattern faced in Computer Science?

Can abstract models for solving NP-hard problems be built in reality?

How is Turing Machine which accepts nothing is not Recursively Enumerable?

The VC dimension of hypothesis space H1 is larger than the VC dimension of hypothesis space H2

Construct a DFA for the following language: L={a^n b^n | n>=1}

Is there a difference between a "finite state machine" and a "state machine"?

Minimum number of states needed?

Turing Machine with non trivial states and transitions

Trending Questions

Popular # Hahtags

Popular Questions