Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6691 LNCS, Issue PART 1, 2011, Pages 465-472

  Nagy, Benedek ^a   Hegedüs, László ^a   Eǧecioǧlu, Ömer ^b  

^a UNIVERSITY OF DEBRECEN   (Hungary)

^b University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTER MACHINES; REAL TIME; NON-REAL TIME;

NEURAL NETWORKS; AUTOMATA THEORY;

NEURAL NETWORKS;

EID: 79957933765     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21501-8_58     Document Type: Conference Paper

References (14)

1. Eǧecioǧlu, Ö., Ibarra, O.H.: On stateless multicounter machines. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 178-187. Springer, Heidelberg (2009)
2. Eǧecioǧlu, Ö., Hegedüs, L., Nagy, B.: Stateless multicounter 5′ → 3′ Watson-Crick Automata. In: Fifth International Conference on Bio-Inspired Computing: Theories and Applications, pp. 1599-1606. IEEE Press, Los Alamitos (2010)
3. Freund, R.: Pǎun, Gh., Rozenberg, G., Salomaa, A.: Watson-Crick Finite Automata. In: Third Annual DIMACS Symposium on DNA Based Computers, Philadelphia, pp. 535-546 (1994)
4. Ibarra, O.H., Eǧecioǧlu, Ö.: Hierarchies and characterizations of stateless multicounter machines. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol. 5609, pp. 408-417. Springer, Heidelberg (2009)
5. Ibarra, O.H., Karhumäki, J., Okhotin, A.: On stateless multihead automata: Hierarchies and the emptiness problem. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 94-105. Springer, Heidelberg (2008)
6. Leupold, P., Nagy, B.: 5′ →3′ Watson-Crick automata with several runs. In: Workshop on Non-Classical Models of Automata and Applications (NCMA), Wroclaw, Poland, pp. 167-180. book@ocg.at, Österreichischen Computer Gesellschaft (2009)
7. Leupold, P., Nagy, B.: 5′ →3′ Watson-Crick automata with several runs. Fundamenta Informaticae 104, pp. 71-91, extended version of [6] NCMA2009 (2010)
8. Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
9. Nagy, B.: On a hierarchy of 5′ →3′ sensing WK finite automata languages. In: CiE 2009: Mathematical Theory and Computational Practice, Abstract Booklet, pp. 266-275. University of Heidelberg (2009)
10. Nagy, B.: On 5′ →3′ Sensing Watson-Crick Finite Automata. In: Garzon, M.H., Yan, H. (eds.) DNA 2007. LNCS, vol. 4848, pp. 256-262. Springer, Heidelberg (2008)
11. Pǎun, G.: Computing with Membranes. Journal of Computer and System Sciences 61/1, 108-143 (2000)
12. Pǎun, G.: Computing with Membranes: An Introduction. Springer, Berlin (2002)
13. Pǎun, G., Rozenberg, G., Salomaa, A.: DNA Computing: New Computing Paradigms. Springer, Heidelberg (1998)
14. Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. In: Pre-Proceedings of Workshop on Automata for Cellular and Molecular Computing, pp. 144-157 (2007)