4.6 Article

Analyzing the Trade-Off Between Complexity Measures, Ambiguity in Insertion System and Its Applications

Related references

Note: Only part of the references are listed.
Article Computer Science, Information Systems

On path-controlled insertion-deletion systems

Henning Fernau et al.

ACTA INFORMATICA (2019)

Proceedings Paper Computer Science, Theory & Methods

Universal Matrix Insertion Grammars with Small Size

Henning Fernau et al.

UNCONVENTIONAL COMPUTATION AND NATURAL COMPUTATION, UCNC 2017 (2017)

Proceedings Paper Computer Science, Software Engineering

Graph-Controlled Insertion-Deletion Systems Generating Language Classes Beyond Linearity

Henning Fernau et al.

DESCRIPTIONAL COMPLEXITY OF FORMAL SYSTEMS, DCFS 2017 (2017)

Article Automation & Control Systems

MODELLING DNA AND RNA SECONDARY STRUCTURES USING MATRIX INSERTION-DELETION SYSTEMS

Lakshmanan Kuppusamy et al.

INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS AND COMPUTER SCIENCE (2016)

Article Computer Science, Theory & Methods

ON THE AMBIGUITY OF INSERTION SYSTEMS

Lakshmanan Kuppusamy et al.

INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2011)

Article Engineering, Electrical & Electronic

On the study of ambiguity and the trade-off between measures and ambiguity in insertion–deletion languages

Lakshmanan Kuppusamy et al.

Nano Communication Networks (2011)

Article Computer Science, Theory & Methods

A note on ambiguity of internal contextual grammars

Lakshmanan Kuppusamy

THEORETICAL COMPUTER SCIENCE (2006)

Article Computer Science, Theory & Methods

Context-free insertion-deletion systems

M Margenstern et al.

THEORETICAL COMPUTER SCIENCE (2005)

Article Biochemical Research Methods

The language of RNA: a formal grammar that includes pseudoknots

E Rivas et al.

BIOINFORMATICS (2000)