论文信息 - On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages - 字舞流文

On a hierarchy of 5′ → 3′ sensing Watson-Crick finite automata languages

[1] Peter Leupold,et al. 5' -> 3' Watson-Crick AutomataWith Several Runs , 2010, Fundam. Informaticae.

[2] Benedek Nagy,et al. Pumping lemmas for linear and nonlinear context-free languages , 2010, ArXiv.

[3] Benedek Nagy,et al. On 5' --> 3' Sensing Watson-Crick Finite Automata , 2007, DNA.

[4] G. R. Putzolu,et al. Generalizations of Regular Events , 1965, Inf. Control..

[5] G. R. Putzolu,et al. On a Family of Linear Grammars , 1964, Inf. Control..

[6] Sadaki Hirose,et al. The Relations among Watson-Crick Automata and Their Relations with Context-Free Languages , 2006, IEICE Trans. Inf. Syst..

[7] Rudolf Freund,et al. Watson-Crick finite automata , 1997, DNA Based Computers.

[8] José M. Sempere,et al. A Representation Theorem for Languages Accepted by Watson-Crick Finite Automata , 2004, Bull. EATCS.