Iterative tree automata
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3911718 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3628373 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- Generation of Primes by a One-Dimensional Real-Time Iterative Array
- On real-time cellular automata and trellis automata
- Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
- Real-time language recognition by one-dimensional cellular automata
- Systolic automata for VLSI on balanced trees
- Triangle cellular automata
Cited in
(17)- Synthesis, structure and power of systolic computations
- Iterative arrays with self-verifying communication cell
- Iterative pairs and multitape automata
- Topological transformations as a tool in the design of systolic networks
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
- Iterative arrays with self-verifying communication cell
- Real-time, pseudo real-time, and linear-time ITA
- Optimal simulation of tree arrays by linear arrays
- On iterative and cellular tree arrays
- Goodby to the kindhearted dragon Prof. Sheng Yu, 1950--2012
- Estimates of the operating time of stable iterative, language-modeling, and recognition systems
- Computation theoretic aspects of cellular automata
- Cellular automata with sparse communication
- Alternating tree automata
- Nested Sibling Tree Automata
- Non-deterministic cellular automata and languages
- Iterative tree arrays with logarithmic depth†
This page was built for publication: Iterative tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796998)
