Name
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. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11750321_53 | TAMC |
Keywords | Field | DocType |
practical scheme,practical issue,useful model,context-free language,computer science,complex data structure,computable function,towards practical computable function,complex data,structured data,computability,operator,context free language | μ-recursive function,Data structure,Combinatorics,Context-free language,Computer science,Theoretical computer science,Computability,Operator (computer programming),Data model,Computable function,Computable analysis | Conference |
Volume | ISSN | ISBN |
3959 | 0302-9743 | 3-540-34021-1 |
Citations | PageRank | References |
1 | 0.36 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haiming Chen | 1 | 266 | 32.36 |
| Yunmei Dong | 2 | 4 | 1.13 |