Permutation automaton
id:
permutation-automaton-307-13755798
title:
Permutation automaton
text:
In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set of states. Formally, a deterministic finite automaton A may be defined by the tuple (Q, Σ, δ, q0, F),
where Q is the set of states of the automaton, Σ is the set of input symbols, δ is the transition function that takes a state q and an input symbol x to a new state δ(q,x), q0 is the initial state of the automaton, and F is the set of accepting st
brand slug:
wiki
category slug:
encyclopedia
description:
Finite-state machine in automata theory
original url:
https://en.wikipedia.org/wiki/Permutation_automaton
date created:
date modified:
2023-08-22T15:04:33Z
main entity:
{"identifier":"Q7169368","url":"https://www.wikidata.org/entity/Q7169368"}
image:
fields total:
13
integrity:
14