On the splicing operation
作者： Gheorghe Păun
DOI: 10.1016/0166-218X(96)00101-1
关键词: Regular language 、 Set (abstract data type) 、 Mathematics 、 Discrete mathematics 、 Simple (abstract algebra) 、 Series (mathematics) 、 Algebra 、 Closure (mathematics) 、 Iterated function 、 RNA splicing 、 Infinite set
摘要: Abstract We propose here a systematic formal study of the splicing operation introduced by Head as model recombinant behavior DNA. consider both simple and iterated splicing, with respect to finite or an infinite set rules, in latter case whole rules constituting regular language. Relations between these operations usual languages are investigated, well closure Chomsky language families under operations. A series open problems formulated too.
elsevier.com
sci-hub.se 参考文章(20)
Jozef Gruska, Descriptional Complexity of Context-Free Languages. mathematical foundations of computer science. pp. 71- 83 ,(1973)
Tom Head, Splicing Schemes and DNA Lindenmayer Systems. pp. 371- 383 ,(1992) , 10.1007/978-3-642-58117-5_23
Seymour Papert, Robert McNaughton, Counter-Free Automata ,(1971)
Arto Salomaa, Grzegorz Rozenberg, Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology Springer-Verlag. ,(2001)
Gheorghe Paun, Jrgen Dassow, Regulated rewriting in formal language theory ,(1989)
Seymour Ginsburg, Algebraic and Automata Theoretic Properties of Formal Languages ,(1975)
Arto Salomaa, Grzegorz Rozenberg, Grzegorz Rozenberg, The mathematical theory of L systems ,(1980)
Aldo De Luca, Antonio Restivo, A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup Information & Computation. ,vol. 44, pp. 300- 319 ,(1980) , 10.1016/S0019-9958(80)90180-1
A. Lindenmayer, G. Rozenberg, Developmental systems and languages ,(1975)
Arto Salomaa, On the index of a context-free grammar and language Information & Computation. ,vol. 14, pp. 474- 477 ,(1969) , 10.1016/S0019-9958(69)90164-8