On stateless multihead automata: Hierarchies and the emptiness problem

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

Volumn 4957 LNCS, Issue , 2008, Pages 94-105

  Ibarra, Oscar H ^a   Karhumäki, Juhani ^b   Okhotin, Alexander ^b,c  

^a University of California   (United States)

^b UNIVERSITY OF TURKU   (Finland)

^c ACADEMY OF FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

HIERARCHICAL SYSTEMS; PROBLEM SOLVING; THEOREM PROVING; UNCERTAIN SYSTEMS; FINITE AUTOMATA; ROBOTS; TRANSLATION (LANGUAGES);

NONDETERMINISTIC VARIATIONS; STATELESS MULTIHEAD AUTOMATA; EMPTINESS PROBLEM; INFORMATICS; LATIN AMERICAN; TWO-WAY AUTOMATA;

FINITE AUTOMATA; AUTOMATA THEORY;

EID: 43049111773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_9     Document Type: Conference Paper

References (8)

1. Domaratzki, M.: Personal communication (August 2007)
2. Monien, B.: Two-way multihead automata over a one-letter alphabet. RAIRO Informatique theoretique 14(1), 67-82 (1980)
3. Paun, G.: Computing with membranes. Journal of Computer and System Sciences 61(1), 108-143 (2000)
4. Paun, G.: Membrane Computing, An Introduction. Springer, Heidelberg (2002)
5. Rosenberg, A.L.: On multi-head finite automata. IBM Journal of Research and Development 10(5), 388-394 (1966)
6. Yang, L., Dang, Z., Ibarra, O.H.: Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing. In: Akl, S.G., Calude, C.S., Dinneen, M.J., Rozenberg, G., Wareham, H.T. (eds.) UC 2007. LNCS, vol. 4618, pp. 226-241. Springer, Heidelberg (2007)
7. Yang, L., Dang, Z., Ibarra, O.H.: On stateless automata and P systems. In: PreProceedings of Workshop on Automata for Cellular and Molecular Computing (August 2007)
8. Yao, A.C., Rivest, R.L.: k + 1 heads are better than k. Journal of the ACM 25(2), 337-340 (1978)