Steedman's temporality proposal and finite automata

  • Authors:
  • Tim Fernando

  • Affiliations:
  • Trinity College Dublin, Ireland

  • Venue:
  • AC'11 Proceedings of the 18th Amsterdam colloquim conference on Logic, Language and Meaning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The proposal from Steedman 2005 that "the formal devices" required for temporality in linguistic semantics "are those related to representation of causality and goal-directed action" is developed using finite automata, implicit in which are notions of causality (labeled transitions) and goal-directed action (final/accepting states). A bounded granularity is fixed through a finite alphabet, the temporality of which is given special attention and applied to causal models. A notion of a string in compliance with a causal model is defined such that for a finite causal model M, the set of strings compliant with M is a regular language.