The following pages link to Systolic trellis automatata † (Q3687722):
Displaying 29 items.
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Nondeterministic, probabilistic and alternating computations on cellular array models (Q673634) (← links)
- Characterizations and computational complexity of systolic trellis automata (Q792091) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- A property of real-time trellis automata (Q1079372) (← links)
- Relating the power of cellular arrays to their closure properties (Q1104098) (← 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)
- Some hierarchies for the communication complexity measures of cooperating grammar systems (Q1325838) (← links)
- Boolean grammars (Q1886037) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Conjunctive grammars and alternating pushdown automata (Q2377302) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)
- Sur quelques classes d’applications de $N^2$ dans les ensembles finis (Q3031941) (← links)
- Fault-tolerant schemes for some systolic systems (Q3804198) (← links)
- (Q3974870) (← links)
- Language classes defined by time-bounded relativised cellular automata (Q4288203) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- (Q4389689) (← 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)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
