| Rough-Set-Like Approximation Spaces for Formal Languages. | 0 | 0.34 | 2022 |
| Local time membrane systems and time Petri nets | 0 | 0.34 | 2020 |
| On the classes of languages characterized by generalized P colony automata. | 0 | 0.34 | 2018 |
| On the Complexity of a Mildly Context-Sensitive Language Class. | 0 | 0.34 | 2018 |
| Deterministic Parsing with P Colony Automata. | 0 | 0.34 | 2018 |
| TCS Special Issue on Languages and Combinatorics in Theory and Nature. | 0 | 0.34 | 2017 |
| Generalized P Colony Automata and Their Relation to P Automata. | 0 | 0.34 | 2017 |
| Watson-Crick T0L Systems and Red-Green Register Machines. | 1 | 0.37 | 2017 |
| On Lindenmayer Systems with Dynamic Control of Parallelism. | 0 | 0.34 | 2016 |
| Simulating P systems with membrane dissolution in a chemical calculus. | 1 | 0.35 | 2016 |
| Chemical Term Reduction with Active P Systems. | 0 | 0.34 | 2016 |
| A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems. | 1 | 0.37 | 2015 |
| Regulating Rule Application with Membrane Boundaries in P Systems. | 0 | 0.34 | 2015 |
| Dynamically Changing Environment for Generalized Communicating P Systems. | 2 | 0.41 | 2015 |
| Deterministic One-Way Turing Machines with Sublinear Space. | 1 | 0.35 | 2015 |
| On The Power Of P Automata | 3 | 0.40 | 2013 |
| On Counter Machines versus dP Automata. | 0 | 0.34 | 2013 |
| Deterministic one-way Turing machines with sublinear space bounds. | 0 | 0.34 | 2013 |
| On the Nonterminal Complexity of Tree Controlled Grammars. | 0 | 0.34 | 2012 |
| Blackhole Pushdown Automata | 2 | 0.43 | 2011 |
| Variants of distributed p automata and the efficient parallelizability of languages | 0 | 0.34 | 2011 |
| Expanding Formal Language And Automata Theory: Bio-Inspired Computational Models | 0 | 0.34 | 2011 |
| Finite dp automata versus multi-head finite automata | 3 | 0.44 | 2011 |
| Cooperating distributed grammar systems: components with nonincreasing competence | 1 | 0.35 | 2011 |
| On the number of components and clusters of non-returning parallel communicating grammar systems | 0 | 0.34 | 2011 |
| On the parallelizability of languages accepted by P automata | 3 | 0.48 | 2011 |
| Pc Grammar Systems With Clusters Of Components | 1 | 0.36 | 2011 |
| Variants Of Competence-Based Derivations In Cd Grammar Systems | 1 | 0.35 | 2010 |
| On the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems. | 0 | 0.34 | 2010 |
| Scattered context grammars generate any recursively enumerable language with two nonterminals | 3 | 0.41 | 2010 |
| On generalized communicating P systems with one symbol | 7 | 0.60 | 2010 |
| Blackhole State-Controlled Regulated Pushdown Automata. | 2 | 0.52 | 2010 |
| Dynamically Formed Clusters Of Agents In Eco-Grammar Systems | 2 | 0.40 | 2009 |
| Variants Of P Colonies With Very Simple Cell Structure | 10 | 0.80 | 2009 |
| On The Size Complexity Of Non-Returning Context-Free Pc Grammar Systems | 1 | 0.36 | 2009 |
| Automata-like Membrane Systems - A Natural Way to Describe Complex Phenomena. | 1 | 0.35 | 2008 |
| (Mem)brane automata | 3 | 0.39 | 2008 |
| Tissue-Like P Systems With Dynamically Emerging Requests | 0 | 0.34 | 2008 |
| Some New Modes of Competence-Based Derivations in CD Grammar Systems | 3 | 0.41 | 2008 |
| Top-down deterministic parsing of languages generated by CD grammar systems | 0 | 0.34 | 2007 |
| P systems with string objects and with communication by request | 1 | 0.36 | 2007 |
| On small universal antiport P systems | 11 | 0.88 | 2007 |
| On Competence In Cd Grammar Systems With Parallel Rewriting | 5 | 0.54 | 2007 |
| Grammar Systems versus Membrane Computing: The Case of CD Grammar Systems | 5 | 0.51 | 2007 |
| Self-assembly of strings and languages | 7 | 0.61 | 2007 |
| On leftmost derivations in CD grammar systems. | 1 | 0.40 | 2007 |
| On the Computational Complexity of P Automata | 30 | 1.89 | 2006 |
| On The Number Of Active Symbols In Lindenmayer Systems | 1 | 0.43 | 2006 |
| Ciliate bio-operations on finite string multisets | 1 | 0.35 | 2006 |
| P finite automata and regular languages over countably infinite alphabets | 5 | 0.64 | 2006 |
