Upper Bounds for Restricted Splicing

Authors:
Hendrik Jan Hoogeboom;Nike van Vugt
Affiliations:
-;-
Venue:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Year:
2002

The family of one-counter languages is closed under quotient

Acta Informatica
Splicing semigroups of dominoes and DNA

Discrete Mathematics
Computing by splicing

Theoretical Computer Science - Special issue on universal machines and computations
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination

Handbook of formal languages, vol. 2
A characterization of non-iterated splicing with regular rules

Where mathematics, computer science, linguistics and biology meet
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Regulations by Valences

MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Hi-index	0.00

We determine or improve upper bounds for non-iterated splicing in length-increasing, length-decreasing, same-length and self splicing mode.