Recursive functions of context free languages (I)

@article{Dong2002RecursiveFO,
  title={Recursive functions of context free languages (I)},
  author={YunMei Dong},
  journal={Science in China Series F: Information Sciences},
  year={2002},
  volume={45},
  pages={25-39}
}
It is intended to establish the recursive function theory on context free languages (CFLs). In this paper, the function class CFRF and its proper subclass CFPRF were defined on CFLs; it is quite straightforward to use them for describing non-numerical algorithms. In fact, they are respectively the partial recursive functions and primitive recursive functions of context free languages. The structure induction method for proving CFPRF function properties was presented. A method for CFL sentence… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Reeursive functions of context free languages (II) Validity of CFPRF and CFRF definitions, Science

  • Dong Yunmei
  • 2002
2 Excerpts

A class of formal grammars and its decision and parsing problems

  • Dang Yunmei, Li Kaide
  • Advances in Mathematics (in Chinese),
  • 1965

Rccursive functions of symbolic expressions , Comm . ACM ,

  • J. McCarthy
  • 1960

Theory of reeursive algorithms

  • Hu Shihua
  • Acta Mathematica Sinica ( in Chinese),
  • 1960

Hu Shihua , Theory of reeursive algorithms , Acta Mathematica Sinica ( in Chinese )

  • N. Cntland
  • An Introduction to Recursive Function Theory

Similar Papers

Loading similar papers…