## Fusion on Languages (2000)

by
Roland Backhouse

Citations: | 3 - 0 self |

### BibTeX

@MISC{Backhouse00fusionon,

author = {Roland Backhouse},

title = {Fusion on Languages},

year = {2000}

}

### OpenURL

### Abstract

Many functions on context-free languages can be expressed in the form of the least fixed point of a function whose definition mimics the grammar of the given language. Examples include the function returning the length of the shortest word in a language, and the function returning the smallest number of edit operations required to transform a given word into a word in a language. This paper presents the basic theory that explains when a function on a context-free language can be de ned in this way. It is shown how the theory can be applied in a methodology for programming the evaluation of such functions.