Conference paper

Publication year: 2009

Pages: 1140-1155

Journal: Information and Computation

Volume number: 207

Issue number: 11

ISSN: 0890-5401

eISSN: 1090-2651

Open access status: Bronze

DOI Link: https://doi.org/10.1016/j.ic.2009.03.002

Conference: 2nd International Conference on Language and Automata Theory and Applications

Publisher: Elsevier

Abstract: 
We introduce and investigate input-revolving finite automata, which are (nondeterministic) finite state automata with the additional ability to shift the remaining part of the input. Three different modes of shifting are considered, namely revolving to the left, revolving to the right, and circular-interchanging. We investigate the computational capacities of these three types of automata and their deterministic variants, comparing any of the six classes of automata with each other and with further classes of well-known automata. In particular, it is shown that nondeterminism is better than determinism, that is, for all three modes of shifting there is a language accepted by the nondeterministic model but not accepted by any deterministic automaton of the same type. Concerning the closure properties most of the deterministic language families studied are not closed under standard operations. For example, we show that the family of languages accepted by deterministic right-revolving finite automata is an anti-AFL which is not closed under reversal and intersection. (C) 2009 Elsevier Inc. All rights reserved.

Harvard Citation style: Bensch, S., Bordihn, H., Holzer, M. and Kutrib, M. (2009) On input-revolving deterministic and nondeterministic finite automata, Information and Computation, 207(11), pp. 1140-1155. https://doi.org/10.1016/j.ic.2009.03.002

APA Citation style: Bensch, S., Bordihn, H., Holzer, M., & Kutrib, M. (2009). On input-revolving deterministic and nondeterministic finite automata. Information and Computation. 207(11), 1140-1155. https://doi.org/10.1016/j.ic.2009.03.002