You need JavaScript to view this

Systolic trees and systolic language recognition by tree automata

Abstract

K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.
Authors:
Publication Date:
Jan 01, 1983
Product Type:
Journal Article
Reference Number:
EDB-85-161834
Resource Relation:
Journal Name: Theor. Comput. Sci.; (Netherlands); Journal Volume: 1-2
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; COMPUTER NETWORKS; ARCHITECTURE; MATHEMATICS; 990200* - Mathematics & Computers
OSTI ID:
5214799
Research Organizations:
Univ. of Turku, Finland
Country of Origin:
Netherlands
Language:
English
Other Identifying Numbers:
Journal ID: CODEN: TCSCD
Submitting Site:
HEDB
Size:
Pages: 219-232
Announcement Date:

Citation Formats

Steinby, M. Systolic trees and systolic language recognition by tree automata. Netherlands: N. p., 1983. Web. doi:10.1016/0304-3975(83)90146-9.
Steinby, M. Systolic trees and systolic language recognition by tree automata. Netherlands. doi:10.1016/0304-3975(83)90146-9.
Steinby, M. 1983. "Systolic trees and systolic language recognition by tree automata." Netherlands. doi:10.1016/0304-3975(83)90146-9. https://www.osti.gov/servlets/purl/10.1016/0304-3975(83)90146-9.
@misc{etde_5214799,
title = {Systolic trees and systolic language recognition by tree automata}
author = {Steinby, M}
abstractNote = {K. Culik II, J. Gruska, A. Salomaa and D. Wood have studied the language recognition capabilities of certain types of systolically operating networks of processors (see research reports Cs-81-32, Cs-81-36 and Cs-82-01, Univ. of Waterloo, Ontario, Canada). In this paper, their model for systolic VLSI trees is formalised in terms of standard tree automaton theory, and the way in which some known facts about recognisable forests and tree transductions can be applied in VLSI tree theory is demonstrated. 13 references.}
doi = {10.1016/0304-3975(83)90146-9}
journal = {Theor. Comput. Sci.; (Netherlands)}
volume = {1-2}
journal type = {AC}
place = {Netherlands}
year = {1983}
month = {Jan}
}