scholarly journals Learning context-free grammars from structural data in polynomial time

1990 ◽  
Vol 76 (2-3) ◽  
pp. 223-242 ◽  
Author(s):  
Yasubumi Sakakibara
Keyword(s):  
Polynomial Time ◽  
Structural Data ◽  
Learning Context ◽  
Context Free ◽  
Context Free Grammars

FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME

2010 ◽  
Vol 21 (04) ◽  
pp. 597-618 ◽  
Author(s):  
PAWEŁ GAWRYCHOWSKI ◽  
DALIA KRIEGER ◽  
NARAD RAMPERSAD ◽  
JEFFREY SHALLIT
Keyword(s):  
Growth Rate ◽  
Polynomial Time ◽  
Exponential Growth ◽  
Polynomial Growth ◽  
Time Algorithm ◽  
Polynomial Time Algorithms ◽  
Context Free Language ◽  
Context Free ◽  
Free Language ◽  
Context Free Grammars

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 an 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.

Sign in / Sign up

Export Citation Format

Share Document