Observational complexity of character strings.
Joel Seiferas · DSpace@MIT (Massachusetts Institute of Technology) · 1972
How much information about a character string is needed to recognize the string? The answer to this question depends, of course, on what kind of information is available and what is meant by "how much." Several alternative kinds of information about strings are considered in this thesis. In each case, however, the actual pieces of information are called reports, and each report is either a 1-report, a 2-report, a 3-report, or so on. In the main investigation of the thesis, the reports on a string are the strings obtained from the string by deleting some char-acters. For example, the reports on the string abba fall into four cate-gories: