Skip to main content
tylerh111's user avatar
tylerh111's user avatar
tylerh111's user avatar
tylerh111
  • Member for 4 years
  • Last seen more than 1 year ago
6 votes
Accepted

Context Free Grammar to Regular Expression?

4 votes

What is the difference between directed graph and bidirectional graph?

2 votes

Big-O notation for Polynomial Time Complexity

2 votes

What's the name of this DFS variation

2 votes

Prove that following grammar is ambiguous; S → a | S + S | S S | S* | ( S )

2 votes
Accepted

MST and some facts via an example

1 vote

Is $L = \{ a^ib^j : 0 < j < i < 2j\}$ context free? How can it be shown?

1 vote

Context free grammar problem for number of a's is twice the number of b's

1 vote

What are the units for time complexity graphs?

0 votes
Accepted

The number of connected components in the context of cyclomatic complexity

0 votes

In an NFA, what if there are no transitions out of an accept state but there are symbols left in the string?

0 votes
Accepted

Why is the following grammar not LL(1)

0 votes
Accepted

write adt for stack operations

-1 votes

Difference between a regular and a non-regular language