2022 Developer Survey is open! Take survey.
user avatar
user avatar
user avatar
Vimal Patel
  • Member for 3 years, 2 months
  • Last seen more than a month ago
  • Vadodara, Gujarat, India
9 votes

Are these special (one production) Context-Free Grammars always unambiguous?

5 votes
Accepted

Are Context-Free Grammars with only one Production Rule always Unambiguous?

3 votes

Is there an example of when DFS will not return the min. spanning tree?

3 votes

Closure of CFL against right-quotient with regular languages

2 votes
Accepted

Reducing the halting problem for a language with strings that include at least one 1

2 votes

Converting S->aTbS|epsilon T->aTb|epsilon to chomsky normal form

2 votes

Is this language Recursively Enumerable or Not RE?

2 votes

How to determine if a language is deterministic context-free language?

2 votes
Accepted

Which Tree traversal String is unique?

1 vote

question about the construction of BSTs using a repeated sequence of rotations

1 vote

Does DFS in an unweighted DAG find the shortest path for each vertex from a source?

1 vote

Can a Non-Deterministic Pushdown Automaton recognize $ \# a^nb^{2^n} \# $ which a TM can?

1 vote
Accepted

Third Normal Form and Boyce Code normal form

1 vote

Thomas write rula andview serializability

1 vote
Accepted

Time complexity described by recurrence relation

1 vote
Accepted

Find two numbers in sorted array whose product is close to N

1 vote

What is the difference between Big(O) and small(o) notations in asymptotic analysis?

0 votes

Question about growth rates of functions involving n and logn