| Information | |
|---|---|
| has gloss | eng: 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. |
| lexicalization | eng: permutation automaton |
| instance of | (noun) act of changing the lineal order of objects in a group permutation |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint