sjmc's user avatar
sjmc's user avatar
sjmc's user avatar
sjmc
  • Member for 9 years, 11 months
  • Last seen more than 2 years ago
6 votes
Accepted

Computing the intersection of two NPDA where it is possible

5 votes

What is the point of (Compactness theorem in the) Overspill principle?

4 votes
Accepted

Number of Final States Subset Construction for NFA to DFA

3 votes
Accepted

Proof that $A_{DFA}$ is decidable in Sipser

1 vote

Is there a basic proof that there exists some edit distance between two strings?

1 vote
Accepted

Canonical infinitely ambiguous languages

1 vote

Demonstrate that DPDA is closed under complement by construction

0 votes

What is Finite Automata Bowl?

0 votes

Find the minimum amount of swaps in fixed indices to sort an array

0 votes
Accepted

Does there exist a proof of closure of regular languages under regular substitution by giving the corresponding DFA?

0 votes
Accepted

Showing that DNF VALID is coNP-hard