All sessions are open to any interested person.
Organization al meeting, topic introductions by Case, Collins, Saunders. I have devised an efficient modification of the least remainder GCD algorithm for Gaussian integers. He first posed the problem of characterizing splicing languages, and certain subclasses of the splicing languages. This talk will give a general overview of the history of splicing systems, and recent advances in the characterization problem, with an emphasis on examples and the spirit of some of the proofs involved. By a composed polynomial we mean the polynomial obtained from a given polynomial by replacing each variable by a polynomial.