The following pages link to Systolic trellis automatat† (Q3687723):
Displaying 27 items.
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← 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)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- Topological transformations as a tool in the design of systolic networks (Q1069704) (← links)
- A property of real-time trellis automata (Q1079372) (← links)
- C-tree systolic automata (Q1102750) (← links)
- Variations of the firing squad problem and applications (Q1116339) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- The impact of the number of cooperating grammars on the generative power (Q1193882) (← links)
- Some decision problems for parallel communicating grammar systems (Q1341721) (← links)
- Language equations (Q2074222) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Recognition of poly-slender context-free languages by trellis automata (Q2401759) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Systolic Automata and P Systems (Q2944875) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- (Q3687724) (← links)
- Fault-tolerant schemes for some systolic systems (Q3804198) (← links)
- (Q4034180) (← links)
- (Q4389689) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
