present, this technically decreases expressiveness as it forces to depend only on the number of states that are both initial and final. Some authors restrict to specific semirings, such as or , particularly when studying decidability results. The requirement that there is a zero element for is sometimes omitted; in this case the machine defines a partial function from to rather than a total function. See also References Finite automata