A Concrete Approach to Abstract Recursive Definitions
| dc.date.accessioned | 2004-10-04T14:45:53Z | |
| dc.date.accessioned | 2018-11-24T10:12:25Z | |
| dc.date.available | 2004-10-04T14:45:53Z | |
| dc.date.available | 2018-11-24T10:12:25Z | |
| dc.date.issued | 1972-06-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6207 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6207 | |
| dc.description.abstract | We introduce a non-categorical alternative to Wagner's Abstract Recursive Definitions [Wg-1,2] using a generalization of the notion of clone called a u-clone. Our more concrete approach yields two new theorems: 1.) the free u-clone generated by a ranked set is isomorphic to the set of loop-representable flow diagrams with function symbols in the set, 2.) For every element of a u-clone there is an expression analogous to a regular expression. Several well-known theorems of language and automata theory are drawn as special cases of this theorem. | en_US |
| dc.format.extent | 4924201 bytes | |
| dc.format.extent | 543330 bytes | |
| dc.language.iso | en_US | |
| dc.title | A Concrete Approach to Abstract Recursive Definitions | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AIM-262.pdf | 543.3Kb | application/pdf | View/ |
| AIM-262.ps | 4.924Mb | application/postscript | View/ |