The following pages link to (Q4206409):
Displayed 7 items.
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← 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)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- State complexity of SBTA languages (Q5096343) (← links)