Author： Kim C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.250, Iss.1, 2001-01, pp. : 247-264
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Cooperation in context-free grammars
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :
Access to resources
Recommend
Quantum automata and quantum grammars
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :
Probabilistic hyperedge replacement grammars
By Mosbah M.
Theoretical Computer Science, Vol. 159, Iss. 1, 1996-05 ,pp. :
Structural equivalence and ETOL grammars
By Salomaa K. Wood D. Sheng Y.
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Nonterminal complexity of programmed grammars
By Fernau H.
Theoretical Computer Science, Vol. 296, Iss. 2, 2003-03 ,pp. :