Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
From MaRDI portal
Cited in
(76)- Searching for gapped palindromes
- A multiprocess network logic with temporal and spatial modalities
- Topological transformations as a tool in the design of systolic networks
- T-recognition of T-languages, a new approach to describe and program the parallel pattern recognition capabilities of d-dimensional tessellation structures
- Real-time, pseudo real-time, and linear-time ITA
- On nondeterminism in parallel computation
- Two-dimensional iterative arrays: Characterizations and applications
- Optimal simulation of tree arrays by linear arrays
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- On iterative and cellular tree arrays
- Recognition of topological equivalence of patterns by array automata
- Sequential and cellular graph automata
- A linear speed-up theorem for cellular automata
- Survey of research in the theory of homogeneous structures and their applications
- 1-way stack automaton with jumps
- The behavioral properties of homogeneous structures
- Iterative arrays with direct central control
- Synchronization and computing capabilities of linear asynchronous structures
- Palindrome recognition in real time by a multitape Turing machine
- (A-)synchronous (non)-deterministic cell spaces simulating each other
- Pushdown cellular automata
- Two-dimensional cellular automata recognizer
- The derivation of on-line algorithms, with an application to finding palindromes
- Language not recognizable in real time by one-way cellular automata
- Linear speed-up for cellular automata synchronizers and applications
- Alternation on cellular automata
- Characterization of real time iterative array by alternating device.
- Parallel recognition of rational languages in plane cellular automata
- Hierarchies and undecidability results for iterative arrays with sparse communication
- Computations on one-dimensional cellular automata
- Theory of formal grammars
- Deterministic Turing machines in the range between real-time and linear-time.
- Regular biosequence pattern matching with cellular automata
- Two-dimensional cellular automata and their neighborhoods
- Real-time recognition of languages on an two-dimensional Archimedean thread
- Simulations between cellular automata on Cayley graphs
- Iterative arrays with finite inter-cell communication
- Iterative arrays with self-verifying communication cell
- Some regular state sets in the system of one-dimensional iterative automata
- Real-time language recognition by one-dimensional cellular automata
- Grids and universal computations on one-dimensional cellular automata
- A hierarchy of fast reversible Turing machines
- Non-deterministic cellular automata and languages
- scientific article; zbMATH DE number 3872685 (Why is no real title available?)
- Searching for Gapped Palindromes
- Statistical mechanics of cellular automata
- Some applications of propositional logic to cellular automata
- scientific article; zbMATH DE number 3909766 (Why is no real title available?)
- Iterative tree arrays with logarithmic depth†
- Real-time recognition of substring repetition and reversal
- PROCESSES AND THEIR INTERACTIONS
- On time reduction and simulation in cellular spaces
- On the capabilities of systolic systems
- Achieving universal computations on one-dimensional cellular automata
- Cellular automata: descriptional complexity and decidability
- Real time recognition with cellular automata : a meaningful example
- Cellular automata with limited inter-cell bandwidth
- scientific article; zbMATH DE number 3305096 (Why is no real title available?)
- An improved parallel algorithm for integer GCD
- Constructible functions in cellular automata and their applications to hierarchy results
- Inductive definitions in logic versus programs of real-time cellular automata
- Hierarchies and undecidability results for iterative arrays with sparse communication
- On some open problems concerning the complexity of cellular arrays
- Shrinking one-way cellular automata
- Iterative arrays with finite inter-cell communication
- Iterative arrays with self-verifying communication cell
- A comprehensive taxonomy of cellular automata
- On real time one-way cellular array
- Using fixed-point semantics to prove retiming lemmas
- Intersections de langages algébriques bornes
- Iterative tree automata
- Computation theoretic aspects of cellular automata
- Closure properties of cellular automata
- Real-time reversible iterative arrays
- Low complexity classes of multidimensional cellular automata
- Languages not recognizable in real time by one-dimensional cellular automata
This page was built for publication: Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5560021)
