Permutation automaton
 | This article provides insufficient context for those unfamiliar with the subject. |
A permutation automaton (or p-automaton) is an automaton such that each input permutes the set of states. In other words, a permutation automaton is a reset-free deterministic finite automaton.
A language is p-regular if it is accepted by a permutation automaton.
 | This formal methods-related article is a stub. You can help Wikipedia by expanding it. |