Rare card
Deterministic finite automaton
- Value
- 50 W
- Attack
- 252
- Defence
- 201
- Players
- 0
In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton (DFSA)—is a finite-state machine that accepts or…
Get Deterministic finite automaton in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack