Permutation automaton

From Wikipedia, the free encyclopedia

The introduction to this article provides insufficient context for those unfamiliar with the subject. Please help improve the article with a good introductory style.

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.