| On the Generative Capacity of Contextual Grammars with Strictly Locally Testable Selection Languages. | 0 | 0.34 | 2022 |
| Remarks On External Contextual Grammars With Selection | 0 | 0.34 | 2021 |
| Some remarks on the orbit of closure-involution operations on languages | 0 | 0.34 | 2021 |
| Generating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters. | 0 | 0.34 | 2020 |
| On the Orbit of Closure-Involution Operations – The Case of Formal Languages | 0 | 0.34 | 2019 |
| Grammars with Control by Ideals and Codes. | 0 | 0.34 | 2018 |
| Regular languages of partial words | 4 | 0.58 | 2014 |
| Restarting Automata with Subregular Constraints. | 0 | 0.34 | 2014 |
| Accepting splicing systems with permitting and forbidding words | 2 | 0.55 | 2013 |
| Networks of evolutionary processors: the power of subregular filters | 1 | 0.36 | 2013 |
| Networks of evolutionary processors: computationally complete normal forms | 0 | 0.34 | 2012 |
| Extended Splicing Systems with Subregular Sets of Splicing Rules. | 0 | 0.34 | 2012 |
| Production complexity of some operations on context-free languages | 1 | 0.37 | 2012 |
| Language classes generated by tree controlled grammars with bounded nonterminal complexity | 1 | 0.40 | 2012 |
| Connecting partial words and regular languages | 2 | 0.47 | 2012 |
| Descriptional Complexity of Union and Star on Context-Free Languages. | 0 | 0.34 | 2012 |
| On normal forms for networks of evolutionary processors | 3 | 0.42 | 2011 |
| The role of evolutionary operations in accepting hybrid networks of evolutionary processors | 2 | 0.40 | 2011 |
| Networks of evolutionary processors with subregular filters | 8 | 0.59 | 2011 |
| On Networks of Evolutionary Processors with Filters Accepted by Two-State-Automata | 6 | 0.49 | 2011 |
| Generating Networks of Splicing Processors. | 0 | 0.34 | 2011 |
| Generative Capacity Of Subregularly Tree Controlled Grammars | 7 | 0.56 | 2010 |
| Variants Of Competence-Based Derivations In Cd Grammar Systems | 1 | 0.35 | 2010 |
| Accepting Hybrid Networks Of Evolutionary Processors With Special Topologies And Small Communication | 3 | 0.39 | 2010 |
| On Networks of Evolutionary Processors with State Limited Filters. | 2 | 0.44 | 2010 |
| Evolving Under Small Disruption. | 0 | 0.34 | 2009 |
| Grammars Controlled by Special Petri Nets | 4 | 0.95 | 2009 |
| On Networks of Evolutionary Processors with Nodes of Two Types | 22 | 1.11 | 2009 |
| Accepting Networks of Non-inserting Evolutionary Processors | 4 | 0.46 | 2009 |
| Petri Net Controlled Grammars: the Case of Special Petri Nets | 3 | 0.48 | 2009 |
| A Similarity Measure for Cyclic Unary Regular Languages | 3 | 0.44 | 2009 |
| Conditional Grammars with Commutative, Circular and Locally Testable Conditions | 0 | 0.34 | 2009 |
| Some operations preserving primitivity of words | 4 | 0.61 | 2009 |
| k-Petri Net Controlled Grammars | 5 | 0.67 | 2008 |
| Subregularly Tree Controlled Grammars and Languages | 7 | 3.81 | 2008 |
| On the power of networks of evolutionary processors | 7 | 0.55 | 2007 |
| Comparison of some descriptional complexities of 0L systems obtained by a unifying approach | 2 | 0.39 | 2007 |
| Cd Grammar Systems With Competence Based Entry Conditions In Their Cooperation Protocols | 5 | 0.74 | 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 |
| A remark on evolutionary systems | 0 | 0.34 | 2005 |
| Language Families Defined By A Ciliate Bio-Operation: Hierarchies And Decision Problems | 4 | 0.46 | 2005 |
| On the Size of Components of Probabilistic Cooperating Distributed Grammar Systems | 0 | 0.34 | 2004 |
| On The Descriptional Complexity Of Lindenmayer Systems | 4 | 0.66 | 2004 |
| A ciliate bio-operation and language families | 2 | 0.45 | 2004 |
| On differentiation functions, structure functions, and related languages of context-free grammars | 0 | 0.34 | 2004 |
| On the descriptional complexity of some variants of lindenmayer systems | 3 | 0.56 | 2002 |
| Conditional Grammars with Restrictions by Syntactic Parameters | 0 | 0.34 | 2001 |
| Subregularly controlled derivations: restrictions by syntactic parameters | 2 | 0.40 | 2001 |
