The following pages link to DNA Computing (Q5494343):
Displaying 24 items.
- On the computational complexity of P automata (Q876857) (← links)
- Exact complexity of problems of incompletely specified automata (Q1817068) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- Membrane automata for modeling biomolecular processes (Q2311302) (← links)
- On the classes of languages characterized by generalized P colony automata (Q2413313) (← links)
- Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems (Q2503275) (← links)
- Context-free languages can be accepted with absolutely no space overhead (Q2581536) (← links)
- Variants of Distributed P Automata and the Efficient Parallelizability of Languages (Q2890282) (← links)
- P automata with restricted power (Q2929624) (← links)
- On the Parallelizability of Languages Accepted by P Automata (Q3009345) (← links)
- The Complexity of Mean-Payoff Automaton Expression (Q3167028) (← links)
- P Automata: Membrane Systems as Acceptors (Q3507428) (← links)
- Complexity of some problems from the theory of automata (Q3740247) (← links)
- Computability by finite automata and pisot bases (Q4298373) (← links)
- On a class of<i>P</i>automata (Q4460604) (← links)
- (Q4484483) (← links)
- On the Computational Complexity of Partial Word Automata Problems (Q4589235) (← links)
- On The Space Complexity Of Turn Bounded Pushdown Automata (Q4709850) (← links)
- Computing the Rabin Index of a Parity Automaton (Q4953338) (← links)
- (Q5145160) (← links)
- Membrane Computing (Q5316633) (← links)
- Membrane Computing (Q5901879) (← links)
- Membrane Computing (Q5901890) (← links)
- On computational complexity of set automata (Q5920130) (← links)
