Abstract
We give an O(n+t) time algorithm to determine whether an NFA with n states and t transitions accepts a language of polynomial or exponential growth. Given a NFA accepting a language of polynomial growth, we can also determine the order of polynomial growth in O(n+t) time. We also give polynomial time algorithms to solve these problems for context-free grammars. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Gawrychowski, P., Krieger, D., Rampersad, N., & Shallit, J. (2008). Finding the growth rate of a regular of context-free language in polynomial time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5257 LNCS, pp. 339–358). https://doi.org/10.1007/978-3-540-85780-8_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
