Iterative tree automata

DOI10.1016/0304-3975(84)90043-4zbMath0544.68055OpenAlexW2018272120MaRDI QIDQ796998

Sheng Yu, Karel II Culik

Publication date: 1984

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(84)90043-4

zbMATH Keywords

computational powerbinary tree-connected networkiterative tree automatonlanguage acceptornondeterministic Turing machinesystolic system

Mathematics Subject Classification ID

Related Items (13)

Real-time, pseudo real-time, and linear-time ITA ⋮ 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 ⋮ Synthesis, structure and power of systolic computations ⋮ Cellular automata with sparse communication ⋮ Iterative tree arrays with logarithmic depth^† ⋮ Iterative arrays with self-verifying communication cell ⋮ Iterative arrays with self-verifying communication cell ⋮ GOODBY TO THE KINDHEARTED DRAGON PROF. SHENG YU, 1950–2012 ⋮ Non-deterministic cellular automata and languages ⋮ Computation theoretic aspects of cellular automata ⋮ Topological transformations as a tool in the design of systolic networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On real-time cellular automata and trellis automata
• Systolic automata for VLSI on balanced trees
• Real-time language recognition by one-dimensional cellular automata
• Triangle cellular automata
• Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
• Generation of Primes by a One-Dimensional Real-Time Iterative Array

This page was built for publication: Iterative tree automata