On equality of multiplicity sets of regular languages (Q1087336)

Every nondeterministic finite automaton A defines a set of naturals \(M_ A\) as follows: n belongs to \(M_ A\) iff there exists a word w such that A accepts w just by n ways. The set \(M_ A\) is called ''the multiplicity set of the regular languages L(A)''. The main theorem is that there is no algorithm deciding, given two finite automata A and B, equality of \(M_ A\) and \(M_ B\).