Pages that link to "Item:Q1055191"
From MaRDI portal
The following pages link to A characterization of systolic binary tree automata and applications (Q1055191):
Displaying 8 items.
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- C-tree systolic automata (Q1102750) (← links)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- Succinctness of descriptions of SBTA-languages (Q1391741) (← links)
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854) (← links)
- State complexity of SBTA languages (Q5096343) (← links)
