wiki_research

commit 8edd267a01ae4038e3a4553f3770ed35762c6b0e
parent aebe490aed2aa6d9cc9dc1b74e898c076090654f
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 19 Nov 2025 19:12:46 +0100

Merge remote-tracking branch 'origin/master'

Diffstat:
database_returning_queries
 | 
8
++++++++
hamiltonian_connected_graph
 | 
9
+++++++++
k_ambiguous_nfa
 | 
2
++
query
 | 
1
+

4 files changed, 20 insertions(+), 0 deletions(-)
diff --git a/database_returning_queries b/database_returning_queries
@@ -0,0 +1,8 @@
+# Database returning queries
+
+[Queries] whose result is a [database], not just a table
+
+- [rink2025query]
+- also a concept in [SPARQL]
+
+Up: [query]
diff --git a/hamiltonian_connected_graph b/hamiltonian_connected_graph
@@ -0,0 +1,9 @@
+# Hamiltonian connected graph
+
+An [undirected_graph] where for any pair of distinct [vertices] there is a [Hamiltonian_path] connecting the vertices
+
+The [decision_problem] of recognizing them is [NP_complete], see [jedlickova2025hamiltonian]
+
+See also: [graph_hamiltonian]
+
+Up: [graph]
diff --git a/k_ambiguous_nfa b/k_ambiguous_nfa
@@ -4,4 +4,6 @@ A *k-unambiguous NFA* is an [NFA] where every [word] has at most k [accepting_ru
 
 For k=1, we get the notion of [UFAs]
 
+[Counting_problem] on [density_function] (number of accepted [words]): [sharp_k_UFA]
+
 Up: [k_ambiguous], [NFA]
diff --git a/query b/query
@@ -6,6 +6,7 @@
 - [Boolean_query]
   - [non_Boolean_query]
 - [query_with_negation]
+- [database_returning_queries]
 
 ## Problems