wiki_research

commit 2400a7499548bb28205b862d51ae6432fd9d4ed5
parent 4fa078529d8daa9730e997bb984226bbbe3874b7
Author: Antoine Amarilli <a3nm@a3nm.net>
Date:   Wed, 21 May 2025 08:59:27 +0200

Merge branch 'master' of a3nm.net:git/wiki_research

Diffstat:
automata_two_way
 | 
2
+-
automaton_cofiniteness
 | 
2
+-
falsifying_valuation
 | 
9
+++++++++
formal_language_computational_problems
 | 
3
+++
regular_path_query
 | 
4
++++
satisfying_valuation
 | 
6
+++---

6 files changed, 21 insertions(+), 5 deletions(-)
diff --git a/automata_two_way b/automata_two_way
@@ -14,4 +14,4 @@ Up: [automata]
 
 See also: [2rpq]
 
-Aliases: two-way automaton, two-way automata
+Aliases: two-way automaton, two-way automata, 2 way automaton, 2 way automata
diff --git a/automaton_cofiniteness b/automaton_cofiniteness
@@ -5,4 +5,4 @@
 [pspace_complete] on [automata_nondeterministic]:
 - https://cstheory.stackexchange.com/questions/54090/complexity-of-nfa-cofiniteness
 
-Up: [automata_problems]
+Up: [automata_problems], [cofiniteness_testing]
diff --git a/falsifying_valuation b/falsifying_valuation
@@ -0,0 +1,9 @@
+# Falsifying valuation
+
+A [Boolean_valuation] such that a [Boolean_function] [evaluates] to [false]
+
+Up: [Boolean_valuation]
+
+See also: [satisfiability_boolean], [satisfying_valuation]
+
+Aliases: falsifying valuations, falsifying assignment, falsifying assignments
diff --git a/formal_language_computational_problems b/formal_language_computational_problems
@@ -4,6 +4,9 @@
 - [language_inclusion]
 - [language_equivalence]
 - [bounded_problem]
+- [finiteness_problem]
+- [emptiness_testing]
+- [cofiniteness_testing]
 
 Up: [formal_language]
 
diff --git a/regular_path_query b/regular_path_query
@@ -21,6 +21,10 @@
 - [rpq_query_evaluation]
 - [pqe_rpq]
 
+## Practice
+
+- [graph_queries_practical]
+
 Up: [graph_query_languages]
 
 See also: [regular_trail_query]
diff --git a/satisfying_valuation b/satisfying_valuation
@@ -1,9 +1,9 @@
 # Satisfying valuation
 
-[Boolean_valuation] such that a [Boolean_function] [evaluates] to [true]
+A [Boolean_valuation] such that a [Boolean_function] [evaluates] to [true]
 
-Up: [boolean_valuation]
+Up: [Boolean_valuation]
 
 Aliases: satisfying assignment, satisfying assignments
 
-See also: [satisfiability_boolean]
+See also: [satisfiability_boolean], [falsifying_valuation]