15 citations · 107 across the 77 of their papers we have counts for
Showing 2007Show all
2 papers · 1 filter
cs.DM2007
Finding the growth rate of a regular language in polynomial time
Dalia Krieger, Narad Rampersad, Jeffrey Shallit
We give an O(n^3+n^2 t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. We also show that given a…
cs.CC2007★ 2 cited
Detecting palindromes, patterns, and borders in regular languages
Terry Anderson, John Loftus, Narad Rampersad +2
Given a language L and a nondeterministic finite automaton M, we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely…