Cellular automata machines: a new environment for modeling
Cellular automata machines: a new environment for modeling
The calculi of emergence: computation, dynamics and induction
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Bioinformatics: the machine learning approach
Bioinformatics: the machine learning approach
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computation: finite and infinite machines
Computation: finite and infinite machines
| Hi-index | 5.23 |
In the computational-mechanics structural analysis of one-dimensional cellular automata the following automata-theoretic analogue of the change-point problem from time series analysis arises: Given a string σ and a collection {Di} offinite automata, identify the regions of σ that belong to each Di and, in particular, the boundaries separating them. We present two methods for solving this multi-regular language filtering problem. The first, although providing the ideal solution, requires a stack, has a worst-case compute time that grows quadratically in σ's length and conditions its output at any point on arbitrarily long windows of future input. The second method is to algorithmically construct a finite transducer that approximates the first algorithm. In contrast to the stack-based algorithm, however, the transducer requires only a finite amount of memory, runs in linear time, and gives immediate output for each letter read; it is, moreover, the best possible finite-state approximation with these three features.