Systolic trees and systolic language recognition by tree automata

DOI10.1016/0304-3975(83)90146-9zbMath0501.68046OpenAlexW1989211940MaRDI QIDQ1172401

Magnus Steinby

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0304-3975(83)90146-9

zbMATH Keywords

tree transformationsdecidabilityformal languagestree transducersrecognizable forestssystolic VLSI treessystolically operating networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Syntactic monoids in the construction of systolic tree automata ⋮ Programmable finite automata for VLSI† ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A characterization of systolic binary tree automata and applications ⋮ A systolic array for the longest common subsequence problem

Cites Work

• On a family of L languages resulting from systolic tree automata
• Systolic automata for VLSI on balanced trees
• Surface tree languages and parallel derivation trees
• Generalized sequential machine maps
• Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Mappings and grammars on trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Systolic trees and systolic language recognition by tree automata