| Publication | Date of Publication | Type |
|---|
On the computational completeness of generalized forbidding matrix grammars
Theoretical Computer Science | 2024-05-06 | Paper |
When Stars Control a Grammar's Work
Electronic Proceedings in Theoretical Computer Science | 2024-04-09 | Paper |
Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1)
Natural Computing | 2024-02-09 | Paper |
Investigations on the power of matrix insertion-deletion systems with small sizes
Natural Computing | 2023-11-30 | Paper |
On the generative capacity of matrix insertion-deletion systems of small sum-norm
Natural Computing | 2023-09-08 | Paper |
Improved descriptional complexity results on generalized forbidding grammars
Discrete Applied Mathematics | 2022-08-04 | Paper |
On the computational completeness of matrix simple semi-conditional grammars
Information and Computation | 2022-03-14 | Paper |
Generalized forbidding matrix grammars and their membrane computing perspective
| 2021-12-01 | Paper |
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars
Fundamenta Informaticae | 2021-10-25 | Paper |
Certain AVL subgraphs of ternary cubes
| 2021-10-15 | Paper |
On the power of generalized forbidding insertion-deletion systems
| 2021-07-14 | Paper |
On matrix ins-del systems of small sum-norm
| 2020-10-22 | Paper |
Descriptional complexity of matrix simple semi-conditional grammars
| 2020-05-12 | Paper |
Improved descriptional complexity results on generalized forbidding grammars
Algorithms and Discrete Applied Mathematics | 2019-10-10 | Paper |
Properties of language classes between linear and context-free
| 2019-02-18 | Paper |
On path-controlled insertion-deletion systems
Acta Informatica | 2019-01-25 | Paper |
On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems
RAIRO - Theoretical Informatics and Applications | 2018-11-01 | Paper |
Computational completeness of simple semi-conditional insertion-deletion systems
| 2018-10-18 | Paper |
Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case
| 2018-06-26 | Paper |
On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes
| 2018-03-29 | Paper |
Graph-controlled insertion-deletion systems generating language classes beyond linearity
| 2017-08-31 | Paper |
Computational completeness of path-structured graph-controlled insertion-deletion systems
| 2017-08-22 | Paper |
On the computational completeness of graph-controlled insertion-deletion systems with binary sizes
Theoretical Computer Science | 2017-06-15 | Paper |
On succinct description of certain context-free languages by ins-del and matrix ins-del systems
International Journal of Foundations of Computer Science | 2017-03-28 | Paper |
Descriptional complexity of graph-controlled insertion-deletion systems
Descriptional Complexity of Formal Systems | 2016-11-09 | Paper |
Generative power of matrix insertion-deletion systems with context-free insertion or deletion
Unconventional Computation and Natural Computation | 2016-09-28 | Paper |
A note on closed-form representation of Fibonacci numbers using Fibonacci trees
ISRN Discrete Mathematics | 2014-11-12 | Paper |
On embedding of certain recursive trees and stars into hypercube
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Embedding height balanced trees and Fibonacci trees in hypercubes
Journal of Applied Mathematics and Computing | 2009-10-23 | Paper |
