The following pages link to (Q4436832):
Displayed 14 items.
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- On the number of nodes in universal networks of evolutionary processors (Q854680) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- Networks of polarized evolutionary processors (Q903660) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Biocomputing: an insight from linguistics (Q1761720) (← links)
- On the size complexity of hybrid networks of evolutionary processors (Q1763710) (← links)
- Hybrid networks of evolutionary processors are computationally complete (Q1772104) (← links)
- Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors (Q2003446) (← links)
- A survey on computationally complete accepting and generating networks of evolutionary processors (Q2104129) (← links)
- On the size of computationally complete hybrid networks of evolutionary processors (Q2271455) (← links)
- On the recognition of context-free languages using accepting hybrid networks of evolutionary processors (Q3446590) (← links)
- About Universal Hybrid Networks of Evolutionary Processors of Small Size (Q3540094) (← links)
- Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules (Q3630028) (← links)