21 citations · 38 across the 18 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.FL2011
A Regularity Measure for Context Free Grammars
M. Praveen
Parikh's theorem states that every Context Free Language (CFL) has the same Parikh image as that of a regular language. A finite state automaton accepting such a regular language i…
cs.LO2011★ 2 cited
Parameterized complexity results for 1-safe Petri nets
M. Praveen, Kamal Lodaya
We associate a graph with a 1-safe Petri net and study the parameterized complexity of various problems with parameters derived from the graph. With treewidth as the parameter, we…