Complexity Measures for Language Recognition by Canonic Systems
Name
MIT-LCS-TR-077.pdf
Size
1.54 MB
Format
Adobe PDF
Checksum (MD5)
0ff116a632cba8f47775f996fa1e1075
Author(s)
Haggerty, Joseph P.
Date Issued
October 1970
Series/Report no.
MIT-LCS-TR-077
MAC-TR-077
Abstract
A canonic system C is a specification of a recursively enumerable set, such as a set of strings over a finite alphabet. From this description C, it is possible to generate a system C , called a proof measure function, which is an indication of the complexity of the language defined. For certain simple but important classes of canonic system, algebraic bounds on these functions can be derived from the structure of the system.
Persistent DSpace Link
