Learn More
We study finite state transduction of automatic and morphic sequences. Dekking [4] proved that morphic sequences are closed under transduction and in particular morphic images. We present a simple proof of this fact, and use the construction in the proof to show that non-erasing transductions preserve a condition called α-substitutivity. Roughly, a sequence(More)
One of the prominent mathematical features of natural language is the prevalence of “upward” and “downward” inferences involving determiners and other functional expressions. These inferences are associated with negative and positive polarity positions in syntax, and they also feature in computer implementations of textual entailment. Formal treatments of(More)
  • 1