Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6207Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Wand, Mitchell | - |
| dc.date | 2004-10-04T14:45:53Z | - |
| dc.date | 2004-10-04T14:45:53Z | - |
| dc.date | 1972-06-01 | - |
| dc.date.accessioned | 2013-10-09T02:44:07Z | - |
| dc.date.available | 2013-10-09T02:44:07Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-262 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6207 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | 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. | - |
| dc.format | 4924201 bytes | - |
| dc.format | 543330 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-262 | - |
| dc.title | A Concrete Approach to Abstract Recursive Definitions | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
