Pages that link to "Item:Q800102"
From MaRDI portal
The following pages link to On a family of L languages resulting from systolic tree automata (Q800102):
Displaying 15 items.
- Completeness results concerning systolic tree automata and E0L languages (Q674289) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- A characterization of systolic binary tree automata and applications (Q1055191) (← links)
- A systolic array for the longest common subsequence problem (Q1066678) (← links)
- C-tree systolic automata (Q1102750) (← links)
- Systolic trees and systolic language recognition by tree automata (Q1172401) (← 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)
- Non acceptability criteria and closure properties for the class of languages accepted by binary systolic tree automata (Q2277854) (← links)
- A note on emptiness for alternating finite automata with a one-letter alphabet (Q2380016) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)
- Syntactic monoids in the construction of systolic tree automata (Q3704911) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
