摘要: Abstract Motivated by the recombinant behavior of DNA, Tom Head introduced a scheme for evolution formal languages called splicing . We give simpler proof fundamental fact that closure regular language under iterated using finite number rules is again regular. then extend this result in two directions, incorporating circular strings and infinite, but regular, sets rules.
elsevier.com
sci-hub.se 参考文章(8)
Tom Head, Splicing Schemes and DNA Lindenmayer Systems. pp. 371- 383 ,(1992) , 10.1007/978-3-642-58117-5_23
Arto Salomaa, Grzegorz Rozenberg, Lindenmayer Systems: Impacts on Theoretical Computer Science, Computer Graphics, and Developmental Biology Springer-Verlag. ,(2001)
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman, Rotwani, Introduction to Automata Theory, Languages, and Computation ,(1979)
Karel Culik, Tero Harju, Splicing semigroups of dominoes and DNA Discrete Applied Mathematics. ,vol. 31, pp. 261- 277 ,(1991) , 10.1016/0166-218X(91)90054-Z
Tom Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology. ,vol. 49, pp. 737- 759 ,(1987) , 10.1007/BF02481771
Gheorghe Păun, Regular extended H systems are computationally universal Journal of Automata, Languages and Combinatorics. ,vol. 1, pp. 27- 36 ,(1996)
Rani Siromoney, K. G. Suhramanian, V. Rajkumar Dare, Circular DNA and Splicing Systems ICPIA '92 Proceedings of the Second International Conference on Parallel Image Analysis. pp. 260- 273 ,(1992) , 10.1007/3-540-56346-6_44
Gheorghe Păun, On the splicing operation Discrete Applied Mathematics. ,vol. 70, pp. 57- 79 ,(1996) , 10.1016/0166-218X(96)00101-1