wiki_research

commit 332d7878aef1e9fc40133d97b38ed2f3ea8cc875
parent 84da387aeb7e28e13a423d5bbb43f6d61887b221
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Mon, 22 Sep 2025 14:53:58 +0200

commit with codex

Diffstat:
glushkov_automaton
 | 
2
++
membership_problem
 | 
2
+-
nfa_minimization
 | 
2
++
primitive_root
 | 
2
++

4 files changed, 7 insertions(+), 1 deletion(-)
diff --git a/glushkov_automaton b/glushkov_automaton
@@ -6,6 +6,8 @@ The *Glushkov automaton* is an [NFA] constructed from a [regular_expression] whi
 
 It is a [homogeneous_automaton]
 
+[glushkov_automaton_construction]
+
 It has O(m^2) transitions with m the [regular_expression], according to [allauzen2006unified] or [nicaud2009average]
 
 Unlike [thompson_automaton], it does not contain [epsilon_transitions]
diff --git a/membership_problem b/membership_problem
@@ -10,4 +10,4 @@ given [formal_language] L description and [word] w, test if w belongs to L
 
 Up: [formal_language_computational_problem]
 
-Aliases: formal language membership problem, formal language membership
+Aliases: formal language membership problem, formal language membership, language membership, language membership problem
diff --git a/nfa_minimization b/nfa_minimization
@@ -4,4 +4,6 @@ https://en.wikipedia.org/wiki/NFA_minimization
 
 There is no [canonical_automaton] for [NFAs]
 
+[kameda1970state]
+
 Up: [minimization_automaton]
diff --git a/primitive_root b/primitive_root
@@ -5,3 +5,5 @@ Given a [word] v, returns the shortest [word] u such that v = u^k for some k
 Note that u is then a [primitive_word]
 
 Up: [operation] on [words]
+
+Aliases: primitive roots