0000000001271436

AUTHOR

Rocco Zaccagnino

showing 2 related works from this author

Unavoidable sets and circular splicing languages

2017

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. They are defined by a finite alphabet A, an initial set I of circular words, and a set R of rules. In this paper, we focus on the still unknown relations between regular languages and circular splicing systems with a finite initial set and a finite set R of rules represented by a pair of letters ( ( 1 , 3 ) -CSSH systems). When R = A × A , it is known that the set of all words corresponding to the splicing language belongs to the class of pure unitary languages, introduced by Ehrenfeucht, Haussler, Rozenberg in 1983. They also provided a characteriza…

Discrete mathematicsClass (set theory)General Computer ScienceRegular languages; Circular splicing systems; Unavoidable sets0102 computer and information sciences02 engineering and technologyRegular languagesCharacterization (mathematics)01 natural sciencesUnitary stateTheoretical Computer ScienceFocus (linguistics)Set (abstract data type)CombinatoricsRegular language010201 computation theory & mathematicsUnavoidable sets0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingFinite setGenerative grammarCircular splicing systemsMathematicsTheoretical Computer Science
researchProduct

Splicing Systems from Past to Future: Old and New Challenges

2014

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will concentrate on a specific behaviour of a type of splicing systems, introduced by P\u{a}un and subsequently developed by many researchers in both linear and circular case of splicing definition. In particular, we will present recent results on this topic and how they stimulate new challenging investigations.

FOS: Computer and information sciencesDiscrete Mathematics (cs.DM)[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Formal Languages and Automata Theory (cs.FL)Splicing Systems Formal Languages.ACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.3: Formal LanguagesACM: F.: Theory of Computation/F.4: MATHEMATICAL LOGIC AND FORMAL LANGUAGES/F.4.2: Grammars and Other Rewriting SystemsComputer Science - Formal Languages and Automata TheorySplicing Systems Formal languages Regular languages DNA computingComputingMilieux_MISCELLANEOUS[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science - Discrete Mathematics
researchProduct