Continuous automaton

About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.

Homogeneous Systolic Pyramid Automata with n-Dimensional Layers

Abstract: Cellular automata were investigated not only in the viewpoint of formal language theory, but also in the viewpoint of pattern recognition. Cellular automata can be classified into some types. A systolic pyramid automata is also one parallel model of various cellular automata. A homogeneous systolic pyramid automaton with n-dimensional layers (n-HSPA) is a pyramid stack of n-dimensional arrays of cells in which the bottom n-dimensional layer (level 0) has size an (a≥1), the next lowest (a-1)n, and so forth, the (a-1)st n-dimensional layer (level (a-1)) consisting of a single cell, called the root. Each cell means an identical finite-state machine. The input is accepted if and only if the root cell ever enters an accepting state. An n-HSPA is said to be a real-time n-HSPA if for every n-dimensional tape of size a n (a≥1) it accepts the n-dimensional tape in time a-1. Moreover, a 1- way n-dimensional cellular automaton (1-nCA) can be considered as a natural extension of the 1-way two- dimensional cellular automaton to n-dimension. The initial configuration is accepted if the last special cell reaches a final state. A 1-nCA is said to be a real- time 1-nCA if when started with n-dimensional array of cells in nonquiescent state, the special cell reaches a final state. In this paper, we propose a homogeneous systolic automaton with n-dimensional layers (n-HSPA), and investigate some properties of real-time n-HSPA. Specifically, we first investigate a relationship between the accepting powers of real-time n-HSPA’s and real-time 1-nCA’s. We next show the recognizability of n-dimensional connected tapes by real-time n-HSPA’s.

A Fast String Matching Algorithm Based on Finite Automaton

Abstract: Pattern match is one of the basic operations in strings.It is necessary to design an efficient algorithm for it.Brings forward a fast pattern match algorithm based on the K.M.P.algorithm and the finite automaton theory.This algorithm takes advantage of the state transformation table of the finite automaton to search for the pattern and avoids the backward moving among the failure links when scanning the text,so that the process of pattern matching is more efficient.The analysis in theory and the experiment both indicate that the speed of the algorithm is higher than the K.M.P.algorithm obviously when there are many backward-moving of the failure link when a mismatch occurs locally.However,with respect to the space complexity,the algorithm requires more storage space.

Study for seeking the shortest path on the irregular surface with cellular automata method

Abstract: For the path optimization problem on the irregular surface of three-dimension, three-dimensional surface is discretized with grid Based on the parallel character of cellular automata in the cellular space, with the dynamic cellular neighbors, the time evolution interval is defined as the minimum remaining weight The new shortest path algorithm is structured, based on cellular automaton model That is to say, through the simple rules of evolution of cellular state, the shortest path is got And a new way of application of the Cellular Automata model is provided

A Recursive Padding Technique on Nondeterministic Cellular Automata

Abstract: We present a tight time-hierarchy theorem for nondeterministic cellular automata by using a recursive padding argument. It is shown that, if t2(n) is a time-constructible function and t2(n) grows faster than t1(n + 1), then there exists a language which can be accepted by a t2(n)-time nondeterministic cellular automaton but not by any t1(n)-time nondeterministic cellular automaton.

An Algorithm for Intercell Communication in a Tesselated Automaton

Abstract: An algorithm is presented which permits any arbitrary subset of the cells of a content addressable tresselated automaton (CATA) to communicate with any other arbitrary subset.