2 edition of **Real-time computation by iterative arrays of finite-state machines** found in the catalog.

Real-time computation by iterative arrays of finite-state machines

S. N. Cole

- 311 Want to read
- 3 Currently reading

Published
**1964**
.

Written in English

**Edition Notes**

Statement | by S.N. Cole. |

ID Numbers | |
---|---|

Open Library | OL20905313M |

Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular automata are ubiquitous: they are mathematical models of computation and computer models of natural systems. The book presents results of cutting edge research in cellular-automata framework of digital physics and modelling of spatially. In this paper, we present a parallel speed-up of a simple, yet significantly powerful, sequential model by cellular automata. The simulated model is called oblivious multi-head finite automata and is characterized by the fact that the trajectory of the heads only depends on the length of the input word. While the original k-head finite automaton works in time O(n k), its corresponding.

Finite state machines. A finite state machine is a form of abstraction (WHY/HOW?). It models the behaviour of a system by showing each state it can be in and the transitions between each state. Consider an elevator: Possible states of the system: 'static on floor 1', 'moving up', 'static on floor 2', 'moving down'. A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.

sively in the literature are the linear iterative array (LIA) and the cellular array (CA) [l, 4, 5, 11, 13, 15, 16, 20, LIAs and CAs are linear bidirectional arrays of finite-state machines (called nodes) and are used as language recognizers. (). On the descriptional complexity of iterative arrays. (). P.M.: Hierarchies of memory limited computations. In: (). Real-time computatioll by n-dimensional iterative arrays of finite-state machines. ().

You might also like

World Major States & Cultures 100ce (World History Wall Maps)

World Major States & Cultures 100ce (World History Wall Maps)

The living world

The living world

Solving business problems

Solving business problems

Goal programming and its application to portfolio selection problems

Goal programming and its application to portfolio selection problems

How does toothpaste get into the tube? and other questions kids ask (Questions Kids Ask)

How does toothpaste get into the tube? and other questions kids ask (Questions Kids Ask)

how and why wonder book of chemistry.

how and why wonder book of chemistry.

Fox Stork

Fox Stork

Heraldic book-collecting.

Heraldic book-collecting.

Layton annual awards.

Layton annual awards.

Census of agriculture.

Census of agriculture.

Japanese opinion polls with socio-political significance, 1947-1957

Japanese opinion polls with socio-political significance, 1947-1957

Approaching ice

Approaching ice

Early French Exposures

Early French Exposures

Assassinations and executions

Assassinations and executions

Abstract: An n-dimensional iterative array of finite-state machines is formally introduced as a real-time tape acceptor. The computational characteristics of iterative arrays are illuminated by establishing several results concerning the sets of tapes that they by: from book Fundamentals of Computation iterative array of finite-state machines is formally introduced as a real-time tape acceptor.

is correspondingly reduced since the computation must be. Iterative arrays are one-dimensional arrays of interconnected interacting finite automata. The cell at the origin is equipped with a one-way read-only input tape.

We investigate iterative arrays Cited by: 2. The recognition speed of context-free languages (CFL’s) using arrays of finite state machines is considered. It is shown that CFL’s can be recognized by 2-dimensional arrays in linear time and by 1 Cited by: Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines.

IEEE Trans. Comput. IEEE Trans. Comput. C, – () Google ScholarAuthor: Martin Kutrib, Andreas Malcher. Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are investigate the classes of languages acceptable by such devices with time bounds of the form n+r(n), where r ∈ o (n) is a sublinear function.

It is shown that there exist infinite time hierarchies of separated complexity classes in that range. Book. Full-text available An n-dimensional iterative array of finite-state machines is formally introduced as a real-time tape acceptor.

reduced since the computation must be real time. We investigate how the choice of the neighborhood can influence the computation ability of two-dimensional cellular automata. We present also a strict inclusion between low and high complexity classes of two-dimensional cellular automata.

S.N. ColeReal-time computation by n-dimensional iterative arrays of finite-state machine. The goal of this paper is to exemplify a conceptual framework, namely the theory of finite state machines, for the VLSI design process. We start from a functional description of the system to be realized and achieve a (semi)systolic array in a formal way.

Moreover, the resulting designs are correct by their mere construction. Real-time computation by n-dimensional iterative arrays of finite-state machines – pages 10 3 Culik II Systolic automata for VLSI on balanced trees pages 10 4 Culik II, K.: Variations of.

There are two simple models of parallel language recognizes: one-way cellular array (OCA) and one-way iterative array (OIA).

For inputs of length n, both arrays consist of n identical finite-state machines (cells). The communication between cells is one way, from left to right. System Sci. (19K [3] C. Choffrut and K. Culik II, On real-time cellular automata and trellis automata, Acta Inform. 21 () [4) S.

Cole, Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. Comput. 18 ( j [5] K. Culik II, and Y. Sheng, Iterative tree automata, Theoret. Comput. Goodman E () R Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines, IEEE Transactions on Computers,(), Online publication date: 1.

One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. Sometimes in the literature this model is referred to as cellular automaton with sequential input mode. We investigate deterministic iterative arrays (IA) with small time bounds between real-time and linear-time.

Abstract. Iterative arrays with restricted internal inter-cell communication are investigated. A quantitative measure for the communication is defined by counting the number of uses of the links between cells and it is differentiated between the sum of all communications of an accepting computation and the maximum number of communications per cell occurring in accepting.

A construction is given of a one-dimensional iterative of finite-state sequential machines, COLE, S: N. Real-time computation by iterative arrays of finite-state machines.

Doctoral Thesis, Report BL, Harvard University, Google Scholar; 3. GINSBURG, S. An Introduction to Mathematical Machine. The model of parallel computation is a one-way linear array of identical finite-state machines.

The data movement in the array is one-way, from left to right. For inputs of length n, the array. Atrubin [1] has shown that there is a one-dimensional iterative array of finite state machines (cf. ) which multiplies in "real time". That is, when the digits of two integers are presented to the machine at the extreme left end of the array a pair at a time, the same machine indicates the product digits at the rate of one per cycle.

On real-time cellular automata and trellis automata. Acta Inf. 21 (I), Google Scholar; 7. COLE, S. Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C, 4 (), Google Scholar; 8. CooK, S. Characterizations of pushdown machines in terms of time-bounded computers.

The speedup is done by using a length k encoding of the input tapes, and realizing blocks of the array as finite-state machines in a new array which operates k times as fast. Part I Finite-state machines. Chapter 2 Finite-state machines.

Chapter 3 Patrick C. (), "Generation of Primes by a onedimensional real-time iterative array," J (July ). Google Scholar Forcada M and Carrasco R Finite-state computation in analog neural networks Emergent neural computational architectures based on. SYSTOLIC ARRAYS: HIGH PERFORMANCE PARALLEL MACHINES FOR MATRIX COMPUTATION Robert Schreiber I.

INTRODUCTION In this paper we shall summarize the recent development of systolic array methods for some of the important. A k-ary iterative tree automaton (k-ary ITA) is a potentially infinite synchronous network of finite automata structured as k-ary tree with serial input and output at the root of the computational power of an ITA in real-time, pseudo real-time and linear-time is compared.

The pseudo real-time is a new notion and means that every cell of an ITA makes a fixed number of computational.