Towards practical computable functions on context-free languages

Authors:
Haiming Chen;Yunmei Dong
Affiliations:
Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Year:
2006

Citing 9
Cited 0

A Grammar-Based Approach Towards Unifying Hierarchical Data Models

SIAM Journal on Computing
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Computable functions and semicomputable sets on many-sorted algebras

Handbook of logic in computer science
Abstract computability and algebraic specification

ACM Transactions on Computational Logic (TOCL)
Yet another meta-language for programming language processing

ACM SIGPLAN Notices
Model Generation by Moderated Regular Extrapolation

FASE '02 Proceedings of the 5th International Conference on Fundamental Approaches to Software Engineering
Balanced grammars and their languages

Formal and natural computing
Practical type checking of functions defined on context-free languages

Journal of Computer Science and Technology
Toward an engineering discipline for grammarware

ACM Transactions on Software Engineering and Methodology (TOSEM)

Quantified Score

Hi-index	0.02

Visualization

Abstract

Many structures used in computer science and software can be represented by context-free languages. This paper discusses computable functions on such languages, which give a useful model for studies of computability and algorithms involving complex data structures. This paper further tackles some practical issues for using the functions. Some practical schemes of the functions are presented. A subclass of functions is provided, which can be implemented efficiently.