We describe the implementation of, and results from, a real-time active surveillance vision system which detects moving objects in an everyday environment, directs the gaze of a head/eye platform towards the objects and subsequently pursues them smoothly. Target detection and pursuit are performed purely on the basis of image motion, and can continue over extended periods. Two independent paral...

Implementation of complex computer circuits assembled from the bottom up and integrated on the nanometer scale has long been a goal of electronics research. It requires a design and fabrication strategy that can address individual nanometer-scale electronic devices, while enabling large-scale assembly of those devices into highly organized, integrated computational circuits. We describe how suc...

The problem of machine translation can be viewed as consisting of two subproblems (a) Lexical Selection and (b) Lexical Reordering. We propose stochas-tic nite-state models for these two subproblems in this paper. Stochastic nite-state models are ee-ciently learnable from data, eeective for decoding and are associated with a calculus for composing models which allows for tight integration of co...

Information hiding is a long established principle in software engineering. However, in the context of finite state machines a contrary principle of information exposure has been suggested. Using a simple example, we examine why a proven abstraction mechanism which works well in other areas may be less successful when applied to a finite state machine model. After using Statecharts [3] to speci...

A method of universal binary entropy coding using simple state machines is presented. We provide a natural rationale for the use of state machines. We discuss the building of state machines which produce uniquely decodable bit streams. Some state machines implement known codes, while others implement finite or even infinite variable length to variable length codes. Once a decodable state machin...

We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [2, 3]. First, we employ the lengthencoding technique proposed and presented in [5, 4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA se...

In this paper, we consider how to hide information into finite state machine (FSM), one of the popular computation models. The key advantage of hiding information in FSM is that the hidden information becomes inexpensive to retrieve, yet still hard to remove or delete. This is due to the fact that verifying certain FSM properties is easy, but changing them requires efforts equivalent to redoing...

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include (1) homomorphisms to Z (2) word length with respect to a finite gener...