A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups
[chapter]
2011
Lecture Notes in Computer Science
A framework for the study of periodic behaviour of twoway deterministic finite automata (2DFA) is developed. Computations of 2DFAs are represented by a two-way analogue of transformation semigroups, every element of which describes the behaviour of a 2DFA on a certain string x. A subsemigroup generated by this element represents the behaviour on strings in x + . The main contribution of this paper is a description of all such monogenic subsemigroups up to isomorphism. This characterization is
doi:10.1007/978-3-642-22321-1_28
fatcat:4xycfjbthncuterrsoigqdfhn4