The following pages link to (Q3687724):
Displaying 20 items.
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Iterative tree automata (Q796998) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- A characterization of systolic binary tree automata and applications (Q1055191) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- C-tree systolic automata (Q1102750) (← links)
- Systolic automata for VLSI on balanced trees (Q1168737) (← links)
- Languages accepted by systolic \(Y\)-tree automata: Structural characterizations (Q1323359) (← links)
- Classes of systolic \(Y\)-tree automata and a comparison with systolic trellis automata (Q1323376) (← links)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Tissue P systems. (Q1401274) (← links)
- Systolic tree \(\omega\)-languages: The operational and the logical view (Q1575949) (← links)
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)
- Syntactic monoids in the construction of systolic tree automata (Q3704911) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
