The representation of sequential concepts as locally testable events
Guy J. Groen · Systems Research and Behavioral Science · 1974
Theoretical accounts of the complexity of patterned sequences usually incorporate a notational scheme for representing the sequence and a classification of complexity derived from the representation. This paper examines (a) whether some modification of this notation also can be applied to finite state languages, and (b) the extent to which finite state languages and patterned sequences vary in complexity for common reasons. A notational system is developed on the basis of automata theory which allows a classification of complexity based on properties of hypothetical pattern matching devices, and can also represent aspects of the induction process.