scientific article; zbMATH DE number 4126708
From MaRDI portal
Publication:4206409
zbMATH Open0687.68036MaRDI QIDQ4206409FDOQ4206409
Authors: Emanuela Fachini, Andrea Maggiolo-Schettini, Davide Sangiorgi, Giovanni Resta 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
- Systolic tree and tree-like automata
- scientific article; zbMATH DE number 4030987
- scientific article; zbMATH DE number 4108159
- SYSTOLIC TREE WITH BASE AUTOMATA
- C-tree systolic automata
- Systolic trellis automata: Stability, decidability and complexity
- Characterizations and computational complexity of systolic trellis automata
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- SIMULATION OF SYSTOLIC TREE AUTOMATA ON TRELLIS AUTOMATA
Cited In (15)
- Synthesis, structure and power of systolic computations
- Succinctness of descriptions of SBTA-languages
- State complexity of SBTA languages
- Characterizations and computational complexity of systolic trellis automata
- Title not available (Why is that?)
- SYSTOLIC TREE WITH BASE AUTOMATA
- Power of interconnections and of nondeterminism in regularY-tree systolic automata
- Syntactic monoids in the construction of systolic tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations
- C-tree systolic automata
- Title not available (Why is that?)
- Completeness results concerning systolic tree automata and E0L languages
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 Q4206409)
