Random Context and Semi-Conditional Insertion-Deletion Systems

Computer Science – Formal Languages and Automata Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this article we introduce the operations of insertion and deletion working in a random-context and semi-conditional manner. We show that the conditional use of rules strictly increase the computational power. In the case of semi-conditional insertion-deletion systems context-free insertion and deletion rules of one symbol are sufficient to get the computational completeness. In the random context case our results expose an asymmetry between the computational power of insertion and deletion rules: systems of size $(2,0,0; 1,1,0)$ are computationally complete, while systems of size $(1,1,0;2,0,0)$ (and more generally of size $(1,1,0;p,1,1)$) are not. This is particularly interesting because other control mechanisms like graph-control or matrix control used together with insertion-deletion systems do not present such asymmetry.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Random Context and Semi-Conditional Insertion-Deletion Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Random Context and Semi-Conditional Insertion-Deletion Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Random Context and Semi-Conditional Insertion-Deletion Systems will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-37188

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.