scientific article; zbMATH DE number 3911718

MaRDI QIDQ3687724zbMATH OpenFDO

Authors Karel II Culik, Arto Salomaa, D. Wood

Publication date 1984

Full work available at URL https://eudml.org/doc/92200

zbMATH Keywords

language acceptorslanguage familytree automataVLSI models

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4126708
• Systolic trellis automatat†
• SYSTOLIC TREE WITH BASE AUTOMATA
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations

Cites work

• scientific article; zbMATH DE number 3802813 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Systolic trees and systolic language recognition by tree automata
• Systolic trellis automatat†
• Tree controlled grammars
• Triangle cellular automata

Cited in

(26)

• A characterization of systolic binary tree automata and applications
• Topological transformations as a tool in the design of systolic networks
• C-tree systolic automata
• Systolic automata for VLSI on balanced trees
• Bottom-up tree acceptors
• Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
• Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
• A Kleene-like characterization of languages accepted by systolic tree automata
• Succinctness of descriptions of SBTA-languages
• Tissue P systems.
• Systolic tree \(\omega\)-languages: The operational and the logical view
• Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata
• Systolic automata and P systems
• Systolic trellis automatat†
• Syntactic monoids in the construction of systolic tree automata
• SYSTOLIC TREE WITH BASE AUTOMATA
• The complexity of systolic dissemination of information in interconnection networks
• Power of interconnections and of nondeterminism in regularY-tree systolic automata
• scientific article; zbMATH DE number 846967 (Why is no real title available?)
• Effective systolic algorithms for gossiping in cycles and two-dimensional grids
• State complexity of SBTA languages
• Completeness results concerning systolic tree automata and E0L languages
• A systolic design for acceptors of regular languages
• Iterative tree automata
• On a family of L languages resulting from systolic tree automata
• Synthesis, structure and power of systolic computations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3687724)