A new algorithm for regularizing one-letter context-free grammars

Author： Andrei S. Cavadini S.V. Chin W.-N.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 113-122

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cooperation in context-free grammars

By Dassow J. Mitrana V.

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 353-361

Elsevier

Access to resources Recommend Favorite

Recursive Parser Optimization by Rewriting Context-Free Grammars

By Giannone A. Eltantawi M.R.A. Maresca P.

Engineering Applications of Artificial Intelligence, Vol. 10, Iss. 6, 1997-12 ,pp. : 607-615

Elsevier

Access to resources Recommend Favorite

A Version Space Approach to Learning Context-free Grammars

By Vanlehn K.

Machine Learning, Vol. 02, Iss. 1, 1987-01 ,pp. : 39-74

Springer Publishing Company

Access to resources Recommend Favorite

Normal form algorithms for extended context-free grammars

By Albert J. Giammarresi D. Wood D.

Theoretical Computer Science, Vol. 267, Iss. 1, 2001-09 ,pp. : 35-47

Elsevier

Access to resources Recommend Favorite

Self-embedded context-free grammars with regular counterparts

By Andrei Stefan Chin Wei-Ngan Cavadini Salvador

Acta Informatica, Vol. 40, Iss. 5, 2004-03 ,pp. : 349-365

Springer Publishing Company

Access to resources Recommend Favorite