On Stateless multihead finite automata and multihead pushdown automata

Pierluigi Frisco, Oscar H. Ibarra

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currently scanned by its k heads, and in every such transition each head can move one cell left, right, or remain stationary. An input, which is delimited by end markers, is accepted if the machine, when started with all heads on the left end marker, reaches the configuration where all the heads are on the right end marker. The nondeterministic version is denoted by k-head 2NFA. We prove that stateless (k+1)-head 2DFAs (resp., 2NFAs) are computationally more powerful than k-head 2DFAs (resp., 2NFAs), improving a recent result where it was shown that (k+4) heads are better than k heads. We also study stateless multihead pushdown automata in their two-way and one-way, deterministic and nondeterministic variations and show that for all these varieties, k+1 heads allow more computational power than k heads. Finally, we give some characterizations of stateless multihead finite and multihead pushdown automata. © 2009 Springer Berlin Heidelberg.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 13th International Conference, DLT 2009, Proceedings
Pages240-251
Number of pages12
Volume5583 LNCS
DOIs
Publication statusPublished - 2009
Event13th International Conference on Developments in Language Theory - Stuttgart, Germany
Duration: 30 Jun 20093 Jul 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5583 LNCS
ISSN (Print)0302-9743

Conference

Conference13th International Conference on Developments in Language Theory
Abbreviated titleDLT 2009
CountryGermany
CityStuttgart
Period30/06/093/07/09

Fingerprint Dive into the research topics of 'On Stateless multihead finite automata and multihead pushdown automata'. Together they form a unique fingerprint.

Cite this