The following pages link to Erzsébet Csuhaj-Varjú (Q387870):
Displaying 50 items.
- (Q197754) (redirect page) (← links)
- On the power of permitting features in cooperating context-free array grammar systems (Q387871) (← links)
- Scattered context grammars generate any recursively enumerable language with two nonterminals (Q407598) (← links)
- On generalized communicating P systems with minimal interaction rules (Q616499) (← links)
- On bounded interpretations of grammar forms (Q808719) (← links)
- On small universal antiport P systems (Q872200) (← links)
- On the computational complexity of P automata (Q876857) (← links)
- On length-separating test tube systems (Q934977) (← links)
- (Mem)brane automata (Q953539) (← links)
- Self-assembly of strings and languages (Q1022589) (← links)
- On the power of cooperation: A regular representation of recursively enumerable languages (Q1176482) (← links)
- Descriptional complexity of context-free grammar forms (Q1210294) (← links)
- Team behaviour in eco-grammar systems (Q1274924) (← links)
- On the computational completeness of context-free parallel communicating grammar systems (Q1287096) (← links)
- Languages of colonies (Q1341745) (← links)
- Power and size of extended Watson-Crick \(L\) systems. (Q1401185) (← links)
- From Watson-Crick L systems to Darwinian P systems (Q1410768) (← links)
- Evolutionary systems: A language generating device inspired by evolving communities of cells (Q1579059) (← links)
- Parallel communicating grammar systems with bounded resources (Q1605310) (← links)
- Further results on generalised communicating P systems (Q1682864) (← links)
- A logical representation of \(\mathrm{P}\) colonies: an introduction (Q1709895) (← links)
- Deterministic parsing with \(\mathrm{P}\) colony automata (Q1709900) (← links)
- APCol systems with teams (Q1749157) (← links)
- Bi-simulation between P colonies and P systems with multi-stable catalysts (Q1749158) (← links)
- Computationally complete generalized communicating P systems with three cells (Q1749159) (← links)
- A remark on evolutionary systems (Q1765382) (← links)
- Hybrid networks of evolutionary processors are computationally complete (Q1772104) (← links)
- Dynamically controlled cooperating/distributed grammar systems (Q1803860) (← links)
- Parallel communicating grammar systems with incomplete information communication (Q1868516) (← links)
- PC grammar systems with five context-free components generate all recursively enumerable languages. (Q1874424) (← links)
- P colonies and reaction systems (Q1982981) (← links)
- Communicating reaction systems with direct communication (Q2055826) (← links)
- Languages of distributed reaction systems (Q2104134) (← links)
- On the size of computationally complete hybrid networks of evolutionary processors (Q2271455) (← links)
- P colonies. Survey (Q2299890) (← links)
- A class of restricted P colonies with string environment (Q2311263) (← links)
- Impacts of membrane computing on theoretical computer science (extended abstract) (Q2328314) (← links)
- APCol systems with verifier agents (Q2328322) (← links)
- On the power and size of extended gemmating P systems (Q2576607) (← links)
- (Q2742601) (← links)
- Dynamically Changing Environment for Generalized Communicating P Systems (Q2789122) (← links)
- Spatially Localised Membrane Systems (Q2805455) (← links)
- (Q2819382) (← links)
- (Q2844498) (← links)
- (Q2882387) (← links)
- Finite dP Automata versus Multi-head Finite Automata (Q2890286) (← links)
- P AUTOMATA WITH RESTRICTED POWER (Q2929624) (← links)
- A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems (Q2945877) (← links)
- CD Grammar Systems: Competence and Confidence (Q3009337) (← links)
- Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence (Q3009338) (← links)
