Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

DFA minimization · Vinony

🌐English

English Deutsch Français Italiano Português Русский العربية فارسی 中文

EntityQ5204896· pop 10· linked from 27 articles

DFA minimization

Task of transforming a deterministic finite automaton

Available in 10 languages

Français
Deutsch
中文
Русский
Português
Italiano
Serbian
Ukrainian
فارسی

via Wikidata sitelinks · CC0

Connections

International Standard Book Number

digital object identifier

Categories

Finite-state machines

Sources

wikipedia.externallinksexternallink

bibcode

Entity

probability distribution

Cambridge University Press

theoretical computer science

automata theory

partition of a set

computational complexity theory

time complexity

John Edward Hopcroft

equivalence class

Jeffrey David Ullman

Sign in to save

What links here27 pages

Suffix automaton

deterministic finite automata

Büchi automaton

regular expression

regular language

Janusz Brzozowski

finite-state machine

automata theory

Powerset construction

deterministic acyclic finite state automaton

Myhill–Nerode theorem

Transformation semigroup

Thompson's construction algorithm

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

nondeterministic finite automaton

Entitydist 0.39

Entitydist 0.44

Algorithmic State Machine

Entitydist 0.53

cellular automaton

Entitydist 0.59

Entitydist 0.59

finite-state machine

Entitydist 0.59

State transition table

Entitydist 0.59

automaton clock

Entitydist 0.59

Jaquet-Droz automata

Entitydist 0.60

Sparse language

Entitydist 0.61

Entitydist 0.61

small form factor

Entitydist 0.63