wiki_research

commit f3f99b7248db696abacabf972ef78cd695337e53
parent 57e7a7692793955fc2c4d88dda072ad49a2298a5
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Sat,  5 Sep 2026 13:40:56 +0200

commit with codex

Diffstat:
automaton_upwards_closed
 | 
2
+-
cerny_conjecture
 | 
9
---------
cernys_conjecture
 | 
4
++++
clique_problem
 | 
2
+-
context_free_grammar_equivalence_problem
 | 
2
+-
dynamic_membership_push_pop
 | 
8
--------
fo_tc
 | 
4
++++
fotc
 | 
7
-------

8 files changed, 11 insertions(+), 27 deletions(-)
diff --git a/automaton_upwards_closed b/automaton_upwards_closed
@@ -14,6 +14,6 @@ All of this holds even if only the right-hand-side [NFA] is upwards-closed, cf a
 
 Up: [language_upwards_closed]
 
-Aliases: upwards closed automaton, Upwards closed automata, automaton subword closed, subword closed automaton, subword closed automata, supersequence closed automaton, supersequence closed automata, automata supersequence closed, automaton supersequence closed
+Aliases: upwards closed automaton, Upwards closed automata, supersequence closed automaton, supersequence closed automata, automata supersequence closed, automaton supersequence closed
 
 See also: [downwards_closed_automaton], [automaton_subsequence_closed]
diff --git a/cerny_conjecture b/cerny_conjecture
@@ -1,9 +0,0 @@
-# Cerny_conjecture
-
-https://en.wikipedia.org/wiki/Synchronizing_word
-
-It is known that an [automata] with a [synchronizing_word] may have no smaller synchronizing word than length (n-1)^2: is there a matching upper bound?
-
-Up: [synchronizing_word]
-
-See also: [completely_reachable_automata]
diff --git a/cernys_conjecture b/cernys_conjecture
@@ -2,6 +2,10 @@
 
 https://en.wikipedia.org/wiki/Synchronizing_word#Length
 
+It is known that an [automata] with a [synchronizing_word] may have no smaller synchronizing word than length (n-1)^2: is there a matching upper bound?
+
+See also: [completely_reachable_automata]
+
 Up: [synchronizing_word], [open_problem]
 
 Aliases: Cerny conjecture
diff --git a/clique_problem b/clique_problem
@@ -13,4 +13,4 @@ Up: [graph_problem] of finding [clique]
 
 See also: [clique_listing], [hyperclique_detection], [hyperclique_conjecture], [cycle_problem], [triangle_detection]
 
-Aliases: k_clique
+Aliases: k clique problem
diff --git a/context_free_grammar_equivalence_problem b/context_free_grammar_equivalence_problem
@@ -9,4 +9,4 @@ It is [undecidable] on [CFGs], by reduction from [CFG_universality]. It is alrea
 
 Up: [formal_language_computational_problem], [context_free_grammar_equivalence]
 
-Aliases: CFG equivalence problem, CFG equivalence
+Aliases: CFG equivalence problem
diff --git a/dynamic_membership_push_pop b/dynamic_membership_push_pop
@@ -1,8 +0,0 @@
-# Dynamic membership push pop
-
-- for [regular_languages]: [guardian_algorithm] in [ganardi2022low]
-- questions plus générales, genre avec [infix_testing] :
-  - présentation [tudastic]
-  - ce mail: <20200429101934.gu6xz5ok6dljjc3k@mu.a3nm.net>
-
-Up: [dynamic_membership_word], [push_pop]
diff --git a/fo_tc b/fo_tc
@@ -4,4 +4,8 @@
 
 Is equivalent to [datalog_stratified_linear]
 
+See also: [separation_logic], [fixpoint], [datalog]
+
 Up: [first_order_logic] with [transitive_closure]
+
+Aliases: FOTC
diff --git a/fotc b/fotc
@@ -1,7 +0,0 @@
-# FO+TC
-
-[first_order_logic] with [transitive_closure] operator
-
-See also: [separation_logic], [fixpoint], [datalog]
-
-Up: [logic]