• Articles •
Semi-input-memory finite automata, a kind of finite automata introduced
by the first author of this paper for studying error propagation, are a
generalization of input-memory finite automata by appending an autonomous
finite automaton component.
In this paper, we give a characterization of the structure of weakly
invertible semi-input-memory finite automata with delay 1, in which
the state graph of each autonomous finite automaton is a cycle.
From a result on mutual invertibility of finite automata obtained by
the authors recently, it leads to a characterization of the structure
of feedforward inverse finite automata with delay 1.
TAO Renji (陶仁骥) and CHEN Shihua (陈世华). Structure of Weakly Invertible Semi-Input-Memory Finite Automata with Delay 1[J]., 2002, 17(4): 0-0.
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks