Jump to content

Permutation automaton

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 199.60.7.231 (talk) at 19:11, 3 December 2004 (start the page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A permutation automaton (or p-automaton) is an automaton such that each input permutes the set of states.

A language is p-regular if it is accepted by a permutation automaton.

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Permutation_automaton&oldid=8089711"