The following pages link to Lakshmanan Kuppusamy (Q285427):
Displayed 37 items.
- Modelling DNA and RNA secondary structures using matrix insertion-deletion systems (Q285429) (← links)
- A note on ambiguity of internal contextual grammars (Q861285) (← links)
- Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case (Q1647317) (← links)
- New nonterminal complexity results for semi-conditional grammars (Q1670738) (← links)
- 1-normal DRA for insertion languages (Q1683524) (← links)
- Formal language representation and modelling structures underlying RNA folding process (Q1683525) (← links)
- On path-controlled insertion-deletion systems (Q1713412) (← links)
- Computational completeness of simple semi-conditional insertion-deletion systems (Q1799363) (← links)
- Universal insertion grammars of size two (Q2004002) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- On the power of generalized forbidding insertion-deletion systems (Q2040409) (← links)
- Generalized forbidding matrix grammars and their membrane computing perspective (Q2055827) (← links)
- On the computational completeness of matrix simple semi-conditional grammars (Q2113382) (← links)
- A cooperative game framework for detecting overlapping communities in social networks (Q2148637) (← links)
- Descriptional complexity of matrix simple semi-conditional grammars (Q2179331) (← links)
- On matrix ins-del systems of small sum-norm (Q2206228) (← links)
- On the computational completeness of graph-controlled insertion-deletion systems with binary sizes (Q2358685) (← links)
- Computational completeness of path-structured graph-controlled insertion-deletion systems (Q2399250) (← links)
- Universal matrix insertion grammars with small size (Q2400963) (← links)
- Graph-controlled insertion-deletion systems generating language classes beyond linearity (Q2400996) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Descriptional Complexity of Graph-Controlled Insertion-Deletion Systems (Q2829975) (← links)
- ON THE AMBIGUITY OF INSERTION SYSTEMS (Q2909109) (← links)
- On Succinct Description of Certain Context-Free Languages by Ins-Del and Matrix Ins-Del Systems (Q2970200) (← links)
- Parikh Images of Matrix Ins-Del Systems (Q2988822) (← links)
- On the Relative Expressive Power of Contextual Grammars with Maximal and Depth-First Derivations (Q3393413) (← links)
- On describing the regular closure of the linear languages with graph-controlled insertion-deletion systems (Q4553829) (← links)
- On the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes (Q4609328) (← links)
- (Q4623037) (← links)
- On the Trade-off Between Ambiguity and Complexity in Contextual Languages (Q4914303) (← links)
- Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars (Q5158664) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5918761) (← links)
- Improved descriptional complexity results on generalized forbidding grammars (Q5919636) (← links)
- Investigations on the power of matrix insertion-deletion systems with small sizes (Q6061993) (← links)
- On the generative capacity of matrix insertion-deletion systems of small sum-norm (Q6095512) (← links)
- Computational completeness of simple semi-conditional insertion-deletion systems of degree (2,1) (Q6150989) (← links)
- When Stars Control a Grammar's Work (Q6204128) (← links)