Regular Splicing Languages

Date: 
Mon, Jun 3, 2013 to Fri, Jun 7, 2013
Author: 
Nataša Jonoska
Location: 
UBC
Conference: 
Automata Theory and Symbolic Dynamics
Abstract: 

Biological motivation
• Mathematical setup
• Examples and prior results
• Regular splicing languages
• regular splicing languages must have a constant
• it is decidable whether a given regular language
is splicing
• Open (characterization, circular splicing languages)

Subject: 
Class: