# Deterministic finite automaton

This English edition is an AI candidate and does not yet have an OCME Atlas (GPT-6) Twin closure receipt.

[Catalogue presentation and source-binding data](https://ocme.evemisslab.com/data/i18n/catalogue.en.json)



## [Deterministic finite automaton](https://ocme.evemisslab.com/en/atlas/atlas-finite-automaton/)

A DFA consists of finite states, a finite alphabet, a total transition function, one initial state and a subset of accepting states.

atlas-finite-automaton · canonical_mko

[Deterministic finite automaton](https://ocme.evemisslab.com/en/mko/mko-finite-automaton/)

## Prerequisite nodes


- [Abstract computational model](https://ocme.evemisslab.com/en/atlas/atlas-computational-model/)
- [Discrete-time dynamical system](https://ocme.evemisslab.com/en/atlas/atlas-discrete-dynamical-system/)
- [Function mapping](https://ocme.evemisslab.com/en/atlas/atlas-function-mapping/)
- [Set](https://ocme.evemisslab.com/en/atlas/atlas-set/)
- [Sequence](https://ocme.evemisslab.com/en/atlas/atlas-sequence/)