Finding the growth rate of a regular language in polynomial time

Simple item page
dc.creatorKrieger, Dalia
dc.creatorRampersad, Narad
dc.creatorShallit, Jeffrey
dc.date2007-11-30
dc.date.accessioned2026-07-07T08:46:28Z
dc.date.available2026-07-07T08:46:28Z
dc.descriptionWe 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 DFA accepting a language of polynomial growth, we can determine the order of polynomial growth in quadratic time.
dc.identifierhttps://arxiv.org/abs/0711.4990
dc.identifierhttp://arxiv.org/abs/0711.4990
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143261
dc.subjectDiscrete Mathematics
dc.subjectData Structures and Algorithms
dc.subjectF.4.3
dc.titleFinding the growth rate of a regular language in polynomial time
dc.typetext

Files

Collections

arXiv