Stateless multicounter 50′ → 30′ Watson-Crick automata: The deterministic case

Natural Computing

Volumn 11, Issue 3, 2012, Pages 361-368

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

^a UNIVERSITY OF DEBRECEN   (Hungary)

^b University of California   (United States)

Author keywords

Counter machine; DNA computing; Membrane computing; Reversal bounded machine; Stateless machine; Universality; Watson Crick automata

Indexed keywords

COMPUTER APPLICATIONS;

COUNTER MACHINES; DNA-COMPUTING; MEMBRANE COMPUTING; REVERSAL-BOUNDED; UNIVERSALITY; WATSON-CRICK AUTOMATA;

AUTOMATA THEORY;

AUTOMATION; COMPUTER ANALYSIS; COMPUTER LANGUAGE; CONFERENCE PAPER; INFORMATION PROCESSING DEVICE; MATHEMATICAL PARAMETERS; STATELESS COUNTER MACHINE;

EID: 84870835420     PISSN: 15677818     EISSN: 15729796     Source Type: Journal    
DOI: 10.1007/s11047-011-9290-9     Document Type: Conference Paper

References (18)

1. Eǧecioǧlu Ö, Ibarra OH (2009) On stateless multicounter machines. In: CiE 2009, LNCS, vol 5635. Springer, Heidelberg, pp 178-187
2. Eǧecioǧlu Ö, Hegedüs L, Nagy B (2010) Stateless multicounter 5′ → 3′ Watson-Crick automata. In: 5th IEEE BIC-TA, pp 1599-1606
3. Freund R, Pǎun G, Rozenberg G, Salomaa A (1994) Watson-Crick finite automata. In: Proceedings of third annual DIMACS symposium on DNA based computers, pp 535-546
4. Hopcroft JE, Ullman JD (1979) Introduction to automata theory, languages and computation. Addison-Wesley, Reading
5. Ibarra OH, Eǧecioǧlu Ö (2009) Hierarchies and characterizations of stateless multicounter machines. In: COCOON 2009, LNCS 5609. Springer, Heidelberg, pp 408-417
6. Ibarra OH, Karhumäki J, Okhotin A (2008) On stateless multihead automata: hierarchies and the emptiness problem. In: LATIN'08, LNCS 4957. Springer, Heidelberg, pp 94-105
7. Korenjak AJ, Hopcroft JE (1966) Simple deterministic languages. In: FOCS, IEEE computer society, Los Alamitos, CA, pp 36-46
8. Kutrib M, Messerschmidt H, Otto F (2008) On stateless twopushdown automata and restarting automata. In: 8th AFL, pp 257-268
9. Leupold P, Nagy B (2009) 5′ → 3′ Watson-Crick automata with several runs. In: NCMA, pp 167-180
10. Leupold P, Nagy B (2010) 5′ → 3′ Watson-Crick automata with several runs. Fundamenta Informaticae 104:71-91
11. Minsky ML (1967) Computation: finite and infinite machines. Prentice-Hall Inc., Upper Saddle River, NJ3
12. Nagy B (2008) On 5′ → 3′ sensing Watson-Crick finite automata. In: DNA 13, LNCS 4848. Springer-Verlag, Berlin, Heidelberg, pp 256-262
13. Nagy B (2009) On a hierarchy of 5′ → 3′ sensing WK finite automata languages. In: CiE 2009, pp 266-275
14. Nagy B, Hegedüs L, Eǧecioǧlu Ö (2011) Hierarchy results on stateless multicounter 5′ → 3′ Watson-Crick automata. In: IWANN 2011, LNCS 6691. Springer, Heidelberg, pp 465-472
15. Pǎun G (1998) Computing with membranes. Technical report, TUCS
16. Pǎun G (2002) Membrane computing: an introduction. Springer-Verlag, Heidelberg
17. Pǎun G, Rozenberg G, Salomaa A (1998) DNA computing: new computing paradigms. Springer-Verlag, Heidelberg
18. Yang L, Dang Z, Ibarra OH (2007) On stateless automata and P systems. In: Workshop on automata for cellular and molecular computing, pp 144-157