Adaptive finite automaton: A new algebraic approach

Abstract

The purpose is to present a new and better representation for the adaptive finite automaton and to also show that both formulations - the original and the newly created - have the same computational power. Adaptive finite automaton original formulation was explored and a way to overcome some difficulties found by [7] in its representation and proofs about its computational power were sought. Afterwards both formulations show to be equivalent in representation and in computational power, but the new one has a highly simplified algebraic notation. The use of the new formulation actually allows simpler theorem proofs and generalizations, as can be verified in the last section of the paper. © 2011 Springer-Verlag.