Computational Mechanics of Input-Output Processes: Structured transformations and the ε-transducer

نویسندگان

  • Nix Barnett
  • James P. Crutchfield
چکیده

Computational mechanics quantifies structure in a stochastic process via its causal states, leading to the process’s minimal, optimal predictor—the -machine. We extend computational mechanics to communication channels coupling two processes, obtaining an analogous optimal model—the -transducer—of the stochastic mapping between them. Here, we lay the foundation of a structural analysis of communication channels, treating joint processes and processes with input. The result is a principled structural analysis of mechanisms that support information flow between processes. It is the first in a series on the structural information theory of memoryful channels, channel composition, and allied conditional information measures.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Mechanics of Input-Output Processes: Structured transformations and the $\epsilon$-transducer

Computational mechanics quantifies structure in a stochastic process via its causal states, leading to the process’s minimal, optimal predictor—the -machine. We extend computational mechanics to communication channels coupling two processes, obtaining an analogous optimal model—the -transducer—of the stochastic mapping between them. Here, we lay the foundation of a structural analysis of commun...

متن کامل

Approximate consistency for transformations on words and trees

We introduce approximate Source-consistency, for transformations of words and trees, the relaxed version of the Source-consistency problem. A setting consists in an input schema, an output schema and a relation T between input and output structures. Given an input structure I, we want to decide if there is an output structure J in the output schema such that (I, J) ∈ T . We consider transducers...

متن کامل

On normalization and type checking for tree transducers

Tree transducers are an expressive formalism for reasoning about tree structured data. Practical applications range from XSLT-like document transformations to translations of natural languages. Important problems for transducers are to decide whether two transducers are equivalent, to construct normal forms, give semantic characterizations, and type checking, i.e., to check whether the produced...

متن کامل

Effects of Structured Input and Meaningful Output on EFL Learners' Acquisition of Nominal Clauses

The current second language (L2) instruction research has raised great motivation for the use of both processing instruction and meaningful output instruction tasks in L2 classrooms as the two focus-on-form (FonF) instructional tasks. The present study investigated the effect of structured input tasks (represented by referential and affective tasks) compared with meaningful output tasks (implem...

متن کامل

First-order Definable String Transformations

The connection between languages defined by computational models and logic for languages is well-studied. Monadic second-order logic and finite automata are shown to closely correspond to each-other for the languages of strings, trees, and partial-orders. Similar connections are shown for first-order logic and finite automata with certain aperiodicity restriction. Courcelle in 1994 proposed a w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1412.2690  شماره 

صفحات  -

تاریخ انتشار 2014