On the complexity of finite autonomous Moore automata

The author considers a restricted class of autonomous automata of the following type \(A=([1;v]\), \(\{x\}\), Y, \(\delta\), \(\lambda)\), where \([1;v]\) is the state set \(\{1,2,...,v\}\), x is the only input, Y is an output set, \(\delta\) maps \([1;v]\) onto \([1;v]\) as follows: \(\delta (a,x)=a+1\) if \(a=1,2,...,v-1\), and the output function \(\lambda\) maps \([1;v]\) onto Y. The paper contains some results about the complexity of A, defined as \[ \max \{\min \{n\in {\mathbb{N}} | \quad \lambda(\delta(a,x^ n)) \neq \lambda(\delta(b,x^ n))\} | \quad a,b\in [1;v],\quad a\neq b\}. \]

Recommendations

Cited in

(13)

This page was built for publication: On the complexity of finite autonomous Moore automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1097701)