Pages that link to "Item:Q792091"
From MaRDI portal
The following pages link to Characterizations and computational complexity of systolic trellis automata (Q792091):
Displaying 31 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)
- 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)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Synthesis, structure and power of systolic computations (Q913515) (← links)
- The Boolean closure of linear context-free languages (Q929298) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Fast parallel language recognition by cellular automata (Q1075053) (← links)
- A property of real-time trellis automata (Q1079372) (← links)
- On iterative and cellular tree arrays (Q1124336) (← links)
- Parallel parsing on a one-way linear array of finite-state machines (Q1183569) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Boolean grammars (Q1886037) (← links)
- Language equations (Q2074222) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Non-deterministic cellular automata and languages (Q2869781) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- On the computational power of totalistic cellular automata (Q3763596) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- Power of interconnections and of nondeterminism in regularY-tree systolic automata (Q4835866) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- A CHARACTERIZATION OF THE ARITHMETICAL HIERARCHY BY LANGUAGE EQUATIONS (Q5704378) (← links)
- On spiking neural P systems (Q5962071) (← links)
- On hardest languages for one-dimensional cellular automata (Q6186307) (← links)
- \(\mathrm{GF}(2)\)-operations on basic families of formal languages (Q6204546) (← links)
