commit 6c9b55868b5ddb1f5ac5439b13b4cf06bd8bd2fa
parent 670ab6c46bbb43e8d0033009dba7db61504fa9a6
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Mon, 11 May 2026 19:28:04 +0200
commit with codex
Diffstat:
14 files changed, 34 insertions(+), 21 deletions(-)
diff --git a/burrows_wheeler_transform b/burrows_wheeler_transform
@@ -2,6 +2,8 @@
[gagie2017wheeler]
-Up: [stringology], [compression_string]
+Up: [text_algorithm], [compression_string]
See also: [wheeler_nfa]
+
+Aliases: BWT
diff --git a/data_complexity b/data_complexity
@@ -6,4 +6,4 @@ introduced in [vardi1982complexity]
Up: [database_theory_complexity]
-See also: [combined_complexity], [query_complexity]
+See also: [combined_complexity], [query_complexity], [data_complexity_classifications]
diff --git a/de_bruijn_sequence b/de_bruijn_sequence
@@ -1,5 +1,7 @@
# De bruijn sequence
+https://en.wikipedia.org/wiki/De_Bruijn_sequence
+
like [universal_word] but for [cyclic_word]
See also: [universal_word]
diff --git a/enumeration_tasks b/enumeration_tasks
@@ -24,5 +24,6 @@
- https://cstheory.stackexchange.com/questions/36334/enumerating-topological-sorts-of-a-vertex-labeled-dag
- [enumeration_valuations]
- [enumeration_posets]
+- [enumeration_regular_languages]
Up: [enumeration]
diff --git a/finite_model_theory b/finite_model_theory
@@ -4,4 +4,4 @@
Up: [model_theory], [finite]
-See also: [Open_world_query_answering]
+See also: [Open_world_query_answering], [finite_model]
diff --git a/gql b/gql
@@ -5,3 +5,5 @@
- [figueira2025complexity] studies the [computational_complexity] of [query_evaluation]
Up: [graph_query_languages_standards]
+
+See also: [sparql]
diff --git a/graph_query_languages b/graph_query_languages
@@ -28,6 +28,7 @@ Also:
- [graph_query_languages_practical]
- [graph_query_languages_standards]
+- [graph_query_languages_features]
Historically: [cruz1987graphical]
diff --git a/induced_subgraph b/induced_subgraph
@@ -8,4 +8,4 @@ See also: [subgraph], [graph_minor], [induced_subhypergraph], [induced_cycle], [
Up: [graph]
-Aliases: induced subgraphs
+Aliases: induced subgraphs, vertex induced subgraph, vertex induced subgraphs
diff --git a/induced_subinstance b/induced_subinstance
@@ -0,0 +1,9 @@
+# Induced subinstance
+
+A [subinstance] defined by a subset of the [active_domain]
+
+See also: [induced_subgraph], [induced_subhypergraph]
+
+Up: [subinstance]
+
+Aliases: vertex induced subinstance
diff --git a/pattern_matching_algorithm b/pattern_matching_algorithm
@@ -5,4 +5,4 @@
- [knuth_morris_pratt]
- [rabin_karp] with [rolling_hash]
-Up: [algorithm] for [pattern_matching]
+Up: [text_algorithm] for [pattern_matching]
diff --git a/regular_language_dichotomies b/regular_language_dichotomies
@@ -1,16 +0,0 @@
-# Regular language dichotomies
-
-- [aaronson2019quantum] about [quantum_query_complexity]
-- [amarilli2021dynamic] about [dynamic_membership]
-- [bathie2025trichotomy] about [property_testing_formal_languages]
-
-- [ganardi2024regular] on [space_complexity] in [sliding_window] model
-
-- [bagan2020trichotomy] about [simple_path_trichotomy]
-- [martens2023trichotomy] about [trail_trichotomy]
-
-- [amarilli2026out] about [out_of_order_membership]
-
-Up: [regular_language], [dichotomy]
-
-See also: [trichotomy], [query_stratification]
diff --git a/smallest_witness b/smallest_witness
@@ -9,6 +9,9 @@ easy for [full_CQs], so hardness comes from [projection]
- [miao2019explaining], with [ptime] algorithm for a specific tuple
- [hu2023finding], [best_paper_award] at [icdt_2024]
+- [minimum_witness_homomorphism_closed]
+- [minimum_witness_vertex_induced_subinstance]
+
Up: [database_theory]
See also: [query_resilience], [smallest_synthetic_witness], [synthetic_witness]
diff --git a/text_algorithms b/text_algorithms
@@ -0,0 +1,8 @@
+# Text algorithms
+
+- [pattern_matching]
+- [burrows_wheeler_transform]
+
+Up: [stringology], [algorithms]
+
+Aliases: string algorithms, text algorithm, string algorithm
diff --git a/word_combinatorics b/word_combinatorics
@@ -4,6 +4,7 @@
- [superpermutation]
- [universal_word]
- [de_bruijn_sequence]
+- [lyndon_words] and [hall_words]
Up: [combinatorics] on [words]
