Pages that link to "Item:Q2277854"
From MaRDI portal
The following pages link to Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854):
Displaying 5 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)
- A Kleene-like characterization of languages accepted by systolic tree automata (Q1333404) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)