The following pages link to Victor Mitrana (Q170454):
Displaying 29 items.
- (Q235180) (redirect page) (← links)
- Primitive morphisms (Q293147) (← links)
- On the computational power of networks of polarized evolutionary processors (Q515676) (← links)
- Complexity-preserving simulations among three variants of accepting networks of evolutionary processors (Q537856) (← links)
- The role of evolutionary operations in accepting hybrid networks of evolutionary processors (Q553303) (← links)
- Bounded hairpin completion (Q553314) (← links)
- Pattern systems (Q672745) (← links)
- On some operations on strings suggested by gene assembly in ciliates (Q698885) (← links)
- Towards biolinguistics (Q700790) (← links)
- Deciding regularity of hairpin completions of regular languages in polynomial time (Q714734) (← links)
- Networks of polarized multiset processors (Q730504) (← links)
- New bounds for the query complexity of an algorithm that learns DFAs with correction and equivalence queries (Q766158) (← links)
- Remarks on arbitrary multiple pattern interpretations (Q845932) (← links)
- Accepting networks of splicing processors: complexity results (Q870258) (← links)
- Networks of polarized evolutionary processors (Q903660) (← links)
- Small universal accepting hybrid networks of evolutionary processors (Q968278) (← links)
- A new characterization of NP, P, and PSPACE with accepting hybrid networks of evolutionary processors (Q970101) (← links)
- Accepting splicing systems (Q974105) (← links)
- On small, reduced, and fast universal accepting networks of splicing processors (Q1004084) (← links)
- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction (Q1004085) (← links)
- On differentiation functions, structure functions, and related languages of context-free grammars (Q4825398) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)
- (Q5507062) (← links)
- Networks of splicing processors: simulations between topologies (Q6048242) (← links)
- Small networks of polarized splicing processors are universal (Q6062027) (← links)
- Hairpin completions and reductions: semilinearity properties (Q6095486) (← links)
- Jump complexity of finite automata with translucent letters (Q6190004) (← links)
- On the Degree of Extension of Some Models Defining Non-Regular Languages (Q6204122) (← links)
