Permutation automaton

From Wikipedia, the free encyclopedia

You have new messages (last change).

The introduction to this article provides insufficient context for those unfamiliar with the subject matter.
Please help improve the introduction to meet Wikipedia's layout standards. You can discuss the issue on the talk page.

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.

Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../p/e/r/Permutation_automaton.html"