Question

when do we say a grammar to be unambiguous with respect to parse tree and derivation tree?

score 1.4k · Answer 1 · 2026-03-29 22:43:46

1.4k

Views

when do we say a grammar to be unambiguous with respect to parse tree and derivation tree?

Published on 29 Mar 2026 - 22:43

score 1k · Answer 2 · 2026-03-24 01:55:49

1k

Views

Stuck on GEB chapter 9 - is b a MU number? is b a TNT number?

Published on 24 Mar 2026 - 1:55

score 3.7k · Answer 3 · 2015-12-11 02:00:40

3.7k

Views

Is constructing a DFA enough to prove that a language is decidable?

Published on 11 Dec 2015 - 2:00

score 1.3k · Answer 4 · 2026-03-25 12:21:13

1.3k

Views

Is $L_1 = \{w ∈ {0,1}∗ | \text{w has at least as many occurrences of (110)’s as (011)’s}\}$ regular?

Published on 25 Mar 2026 - 12:21

score 420 · Answer 5 · 2026-03-31 10:32:06

420

Views

Logic formalization for Perfect Graph Matching problem

Published on 31 Mar 2026 - 10:32

score 102 · Answer 6 · 2015-12-18 15:00:06

102

Views

Semantic values of $\mathcal{L}$-formula in first order Logic?

Published on 18 Dec 2015 - 15:00

score 155 · Answer 7 · 2026-03-27 23:01:34

155

Views

A function given a string ( a program) accepts it if the next program which halts does so in an odd number of steps... is it turing computable

Published on 27 Mar 2026 - 23:01

score 46 · Answer 8 · 2026-03-27 10:08:28

46

Views

Analysing a context-free grammar

Published on 27 Mar 2026 - 10:08

score 64 · Answer 9 · 2015-12-29 15:43:15

64

Views

A polytime language with no subsets of lesser time complexity

Published on 29 Dec 2015 - 15:43

score 729 · Answer 10 · 2026-03-28 06:23:29

729

Views

Representing a $\sigma$ - structure using a signature-$\sigma$ in Mathematical Logic.

Published on 28 Mar 2026 - 6:23

score 64 · Answer 11 · 2026-03-30 00:23:07

64

Views

Prove that if you can derive w from α in n steps, it's possible with n left-derivations as well

Published on 30 Mar 2026 - 0:23

score 227 · Answer 12 · 2026-03-25 16:16:49

227

Views

Prove that two arithmetic grammars generate the same language

Published on 25 Mar 2026 - 16:16

score 1.1k · Answer 13 · 2026-03-27 03:46:07

1.1k

Views

Is there a subtle difference between NOEXTEND(A) vs NOPREFIX(A)?

Published on 27 Mar 2026 - 3:46

score 305 · Answer 14 · 2016-01-08 13:51:56

305

Views

Prove that theory is not Henkin one

Published on 08 Jan 2016 - 13:51

score 217 · Answer 15 · 2016-01-11 19:27:52

217

Views

Using induction to prove a description of a formal language

Published on 11 Jan 2016 - 19:27

List Question

when do we say a grammar to be unambiguous with respect to parse tree and derivation tree?

Stuck on GEB chapter 9 - is b a MU number? is b a TNT number?

Is constructing a DFA enough to prove that a language is decidable?

Is $L_1 = \{w ∈ {0,1}∗ | \text{w has at least as many occurrences of (110)’s as (011)’s}\}$ regular?

Logic formalization for Perfect Graph Matching problem

Semantic values of $\mathcal{L}$-formula in first order Logic?

A function given a string ( a program) accepts it if the next program which halts does so in an odd number of steps... is it turing computable

Analysing a context-free grammar

A polytime language with no subsets of lesser time complexity

Representing a $\sigma$ - structure using a signature-$\sigma$ in Mathematical Logic.

Prove that if you can derive w from α in n steps, it's possible with n left-derivations as well

Prove that two arithmetic grammars generate the same language

Is there a subtle difference between NOEXTEND(A) vs NOPREFIX(A)?

Prove that theory is not Henkin one

Using induction to prove a description of a formal language

Trending Questions

Popular # Hahtags

Popular Questions