Abstract

Events employed in natural language semantics are characterized in terms of regular languages, each string in which can be regarded as a motion picture. The relevant finite automata then amount to movie cameras/projectors, or more formally, to finite Kripke structures with par- tial valuations. The usual regular constructs (concatena- tion, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction.