# deterministic finite automata

> finite-state machine that accepts and rejects strings of symbols and only produces a unique computation (or run) of the automaton for each input string

**Wikidata**: [Q837528](https://www.wikidata.org/wiki/Q837528)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Deterministic_finite_automaton)  
**Source**: https://4ort.xyz/entity/deterministic-finite-automata


## References

1. Quora
2. [OpenAlex](https://docs.openalex.org/download-snapshot/snapshot-data-format)