Iterative tree arrays with logarithmic depth†

DOI10.1080/00207168608803543zbMath0655.68056OpenAlexW2020794524WikidataQ126244949 ScholiaQ126244949MaRDI QIDQ3802619

Karel II Culik, Oscar H. Ibarra, Sheng Yu

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803543

zbMATH Keywords

parallel computingbounded nondeterminismsystolic networkiterative tree arraypushdown stack

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Cellular automata (computational aspects) (68Q80)

Related Items (5)

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 ⋮ On some open problems concerning the complexity of cellular arrays ⋮ Synthesis, structure and power of systolic computations

Cites Work

• Unnamed Item
• Unnamed Item
• On real-time cellular automata and trellis automata
• Iterative tree automata
• A Generalized Dictionary Machine for VLSI
• Speed of Recognition of Context-Free Languages by Array 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 arrays with logarithmic depth^†