Linear and Circular Splicing Systems

@inproceedings{Pixton1995LinearAC,
  title={Linear and Circular Splicing Systems},
  author={Dennis Pixton},
  year={1995}
}
We consider closure properties of classes of languages under the operation of iterated splicing. The main result is that full abstract families of languages are closed under splicing using a regular set of splicing rules. We have the same result for families of circular strings, with two extra assumptions: the languages in the abstract family must be closed under cyclic permutations and the splicing scheme must be reeexive. In both cases the hypotheses are satissed by the families of regular… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…