Jump to content

Permutation automaton

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Michael Hardy (talk | contribs) at 01:25, 29 December 2005 (As one would of course expect, DFA is a long disambiguation page). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

Stub icon

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

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