20
Views
32
CrossRef citations to date
0
Altmetric
Original Articles

Splicing systems and regularity

Pages 63-67 | Received 01 Apr 1989, Published online: 19 Mar 2007

References

  • Denninghoff , K. L. and Gatterdam , R. W. 1989 . On the undecidability of splicing systems . Intern. J. Computer Maths , 27 : 133 – 145 .
  • Gatterdam R. W. Algorithms for splicing systems submitted
  • Head , T. 1987 . Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors . Bull. of Math. Biol. , 49 : 737 – 759 .
  • Hopcroft , J. E. and Ullman , J. D. 1979 . Introduction to Automata Theory, Languages, and Computation , Reading, Mass : Addison Wesley .
  • Mc Naughton , R. and Papert , S. 1971 . Counter-free Automata , Cambridge, Mass : The M.I.T. Press .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.