Semiautomaton

A semiautomaton is a concept used primarily in theoretical computer science and automata theory. It refers to a computational model that operates under rules that are less restrictive than those of a full automaton. While traditional automata, such as finite automata, have a complete set of states and transitions, a semiautomaton may not have all transitions defined for each state or may have an incomplete structure.