activity
20132022
most citedMinimization of visibly pushdown automata is NP-complete

1 citations · 5 across the 8 of their papers we have counts for

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.CC2017★ 1 cited

A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton

Michael Raskin

Unambiguous non-deterministic finite automata have intermediate expressive power and succinctness between deterministic and non-deterministic automata. It has been conjectured that…