commit d9218bfddbee7a71253e066f12f479aac749569a
parent 6ba9399f0e812da69a5013182292e4fd73cec29c
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Wed, 23 Apr 2025 12:28:40 +0200
commit with codex
Diffstat:
3 files changed, 6 insertions(+), 2 deletions(-)
diff --git a/automata_determinization b/automata_determinization
@@ -4,6 +4,10 @@
Usual construction: [powerset_automata]
+The bound on [state_complexity] is exactly 2^n: some [NFAs] on a binary alphabet have n [automaton_states] and their [canonical_DFA] (as a [complete_automaton]) has exactly 2^n [automaton_states]
+- [meyer1971economy]
+- [moore1971bounds]
+
Bounds for specific [automata_classes]:
- [unary_ufa]
diff --git a/minimization_automaton b/minimization_automaton
@@ -9,4 +9,4 @@ Up: [minimization]
Aliases: minimization of automata, automata minimization, automaton minimization, minimization automata, automaton minimal, minimal automaton
-See also: [canonical_labeling]
+See also: [canonical_labeling], [canonical_DFA]
diff --git a/state b/state
@@ -10,4 +10,4 @@ An [automaton] consists of a set of states, which is generally finite.
Up: [automata_concepts]
-Aliases: states
+Aliases: states, automaton states, automata states, automaton state
