scholarly journals Parallel multiple context-free grammars, finite-state translation systems, and polynomial-time recognizable subclasses of lexical-functional grammars

1993 ◽  
Author(s):  
Hiroyuki Seki ◽  
Ryuichi Nakanishi ◽  
Yuichi Kaji ◽  
Sachiko Ando ◽  
Tadao Kasami
Keyword(s):  
Polynomial Time ◽  
Multiple Context ◽  
Finite State ◽  
Translation Systems ◽  
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.

The generative power of multiple context-free grammars and head grammars

1991 ◽  
Vol 22 (4) ◽  
pp. 41-56
Author(s):  
Takashi Matsumura ◽  
Hiroyuki Seki ◽  
Mamoru Fujii ◽  
Tadao Kasami
Keyword(s):  
Generative Power ◽  
Multiple Context ◽  
Context Free ◽  
Context Free Grammars

Generalized context-free grammars and multiple context-free grammars

1989 ◽  
Vol 20 (7) ◽  
pp. 43-52 ◽  
Author(s):  
Tadao Kasami ◽  
Hiroyuki Seki ◽  
Mamoru Fujii
Keyword(s):  
Multiple Context ◽  
Context Free ◽  
Context Free Grammars
Sign in / Sign up

Export Citation Format

Share Document