Premium
The representation of sequential concepts as locally testable events
Author(s) -
Groen Guy J.
Publication year - 1974
Publication title -
behavioral science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 45
eISSN - 1099-1743
pISSN - 0005-7940
DOI - 10.1002/bs.3830190404
Subject(s) - notation , representation (politics) , automaton , finite state machine , sequence (biology) , basis (linear algebra) , theoretical computer science , computer science , state (computer science) , matching (statistics) , process (computing) , computational complexity theory , formal language , algorithm , mathematics , artificial intelligence , programming language , arithmetic , statistics , geometry , politics , biology , political science , law , genetics
Abstract 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.