A Finite-State Approach to Event Semantics Tim Fernando   View Paper (PDF)   Return to Temporal Representation and Reasoning in AI 3 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 partial valuations. The usual regular constructs (concatenation, choice, etc) are supplemented with superposition of strings/automata/languages, realized model-theoretically as conjunction. DiSC'03 © 2003 Association for Computing Machinery