A characterization of systolic binary tree automata and applications

DOI10.1007/BF00289240zbMath0521.68048OpenAlexW2067102568MaRDI QIDQ1055191

Oscar H. Ibarra, Sam M. Kim

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289240

zbMATH Keywords

Turing machinesclosure properties of languages accepted by BTA'ssystolic binary tree automata

Mathematics Subject Classification ID

Related Items (8)

A Kleene-like characterization of languages accepted by systolic tree automata ⋮ C-tree systolic automata ⋮ State complexity of SBTA languages ⋮ Succinctness of descriptions of SBTA-languages ⋮ Synthesis, structure and power of systolic computations ⋮ Completeness results concerning systolic tree automata and E0L languages ⋮ Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata ⋮ Topological transformations as a tool in the design of systolic networks

Cites Work

• On a family of L languages resulting from systolic tree automata
• Systolic automata for VLSI on balanced trees
• Systolic trees and systolic language recognition by tree automata
• Unnamed Item

This page was built for publication: A characterization of systolic binary tree automata and applications