On relations defined by generalized finite automata

  • Authors:

  • C. C. Elgot;J. E. Mezei

  • Affiliations:

  • -;-

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1965

Quantified Score

Hi-index 0.01

Visualization

Abstract

A transduction, in the sense of this paper, is a n-ary word relation (which may be a function) describable by a finite directed labeled graph. The notion of n-ary transduction is co-extensive with the Kleenean closure of finite n-ary relations. The 1-ary transductions are exactly the sets recognizable by finite automata. However, for n 1 the relations recognizable by automata constitute a proper subclass of the n-ary transductions. The 2-ary length-preserving transductions constitute the equilibrium (potential) behavior of 1-dimensional, bilateral iterative networks. The immediate consequencer elation of various primitive deductive (respectively computational) systems, such as Post normal systems (respectively Turing machines) are examples of transductions. Other riches deductive systems have immediate consequence relations which are not transductions. The closure properties of the class of transductions are studied. The decomposition of transductions into simpler ones is also studied.