The following pages link to Victor Mitrana (Q170454):
Displaying 50 items.
- (Q4390535) (← links)
- (Q4413838) (← links)
- (Q4421581) (← links)
- (Q4431369) (← links)
- (Q4434356) (← links)
- (Q4436832) (← links)
- (Q4437815) (← links)
- (Q4449539) (← links)
- (Q4452064) (← links)
- (Q4453228) (← links)
- Teams of pushdown automata (Q4464261) (← links)
- (Q4465340) (← links)
- (Q4474006) (← links)
- (Q4474010) (← links)
- (Q4496487) (← links)
- (Q4503153) (← links)
- (Q4520809) (← links)
- (Q4522246) (← links)
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS (Q4528767) (← links)
- (Q4532220) (← links)
- (Q4550542) (← links)
- (Q4681306) (← links)
- The modular grammars (Q4733420) (← links)
- (Q4782096) (← links)
- On differentiation functions, structure functions, and related languages of context-free grammars (Q4825398) (← links)
- (Q4841275) (← links)
- (Q4853313) (← links)
- (Q4864794) (← links)
- (Q4878723) (← links)
- (Q4884885) (← links)
- (Q4886794) (← links)
- (Q4892611) (← links)
- Chomsky-Schützenberger Type Characterizations of Poly-Slender and Parikh Slender Context-Free Languages1 1Work supported by the Grants-in Aid for Scientific Research No. 1 0440034, Japan Society for the Promotion of Sciences and the Dirección General de (Q4923560) (← links)
- (Q4939006) (← links)
- (Q4939187) (← links)
- (Q4939198) (← links)
- (Q4940888) (← links)
- (Q4969547) (← links)
- SOME REMARKS ON HAIRPIN AND LOOP LANGUAGES (Q5053722) (← links)
- Networks of Polarized Splicing Processors (Q5055983) (← links)
- (Q5061519) (← links)
- (Q5146527) (← links)
- On the Degree of Team Cooperation in CD Grammar Systems (Q5200082) (← links)
- On languages satisfying “interchange Lemma” (Q5286056) (← links)
- Non-preserving splicing with delay (Q5297935) (← links)
- Networks of Polarized Evolutionary Processors Are Computationally Complete (Q5404904) (← links)
- Accepting Networks of Evolutionary Picture Processors (Q5415285) (← links)
- Hairpin Completion Versus Hairpin Reduction (Q5425355) (← links)
- Returning and non-returning parallel communicating finite automata are equivalent (Q5441543) (← links)
- All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size (Q5452560) (← links)
