wiki_research

commit 427abf77ab4504c87b7085b4ea18a80c55613ee6
parent 9c61a3fc6e2ce699d5ec826b73205f3996f2003a
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Fri, 14 Nov 2025 11:07:26 +0100

Merge remote-tracking branch 'origin/master'

Diffstat:
automata_alternating
 | 
2
++
superpermutation
 | 
2
+-

2 files changed, 3 insertions(+), 1 deletion(-)
diff --git a/automata_alternating b/automata_alternating
@@ -9,3 +9,5 @@ Can be seen as an [arena] in [game_theory]
 Up: [automata_types]
 
 Aliases: alternating automaton, alternating automata
+
+See also: [alternating_turing_machine]
diff --git a/superpermutation b/superpermutation
@@ -2,7 +2,7 @@
 
 https://en.wikipedia.org/wiki/Superpermutation
 
-Given a number n, shortest word on alphabet {1, ..., n} containing all permutations as contiguous subsequence, aka "Haruhi problem"
+[haruhi_problem]
 
 Related problem: [superpattern], shortest permutation on n elements containing all k-element permutation as a [permutation_pattern]