commit 52244a4e223a859566ecd072af6cf5c2c6cf0d07
parent c3eab720625319bfb76be8fc6334eca7a491d8e8
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Wed, 26 Aug 2026 00:32:32 +0200
commit with codex
Diffstat:
8 files changed, 14 insertions(+), 9 deletions(-)
diff --git a/automata_nondeterministic_partially_ordered b/automata_nondeterministic_partially_ordered
@@ -1,4 +1,4 @@
-# Automata nondeterministic partially ordered
+# Partially ordered nondeterministic automaton
- [automaton_universality]: [kroetzsch2017complexity]
@@ -6,4 +6,4 @@ Up: [automata_nondeterministic]
See also: [partial_order]
-Aliases: nondeterministic partially ordered automaton, nondeterministic partially ordered automata
+Aliases: nondeterministic partially ordered automaton, nondeterministic partially ordered automata, partially ordered nondeterministic automaton, partially ordered nondeterministic automata
diff --git a/automata_random b/automata_random
@@ -1,7 +1,10 @@
-# Automata random
+# Random automata
- [random_dfa]
+- [random_NFA]
Up: [automata], [randomness]
See also: [random_graph]
+
+Aliases: random automata, random automaton
diff --git a/automaton_complete b/automaton_complete
@@ -1,4 +1,4 @@
-# Automaton complete
+# Complete automaton
A [deterministic_automaton] where the [transition_function] is a [total_function], i.e., for every [state] q and [letter] a there is an outgoing [transition] for q and a
diff --git a/automaton_synchronous b/automaton_synchronous
@@ -1,4 +1,4 @@
-# Automaton synchronous
+# Synchronous automaton
An [automaton] which reads two [words] simultaneously, with pairs of characters and a padding symbol
- [word_convolution] to mean zipping two words together
diff --git a/database_theory_problem b/database_theory_problem
@@ -1,4 +1,4 @@
-# Database theory problem
+# Database theory problems
- [boundedness]
- [query_evaluation]
@@ -13,3 +13,5 @@
- [uniform_reliability]
Up: [database_theory], [computational_problem]
+
+Aliases: database theory problem
diff --git a/datalog_nonrecursive b/datalog_nonrecursive
@@ -1,4 +1,4 @@
-# Datalog nonrecursive
+# Nonrecursive Datalog
[Datalog] which is not [query_recursive]
diff --git a/language_downwards_closed b/language_downwards_closed
@@ -1,4 +1,4 @@
-# Language downwards closed
+# Downwards closed language
A [formal_language] is *downwards closed* if any [subsequence] of a [word] of the [formal_language] is in the [formal_language]
diff --git a/language_upwards_closed b/language_upwards_closed
@@ -1,4 +1,4 @@
-# Language upwards closed
+# Upwards closed language
A [formal_language] is *upwards closed* if any [supersequence] of a [word] of the [formal_language] is in the [formal_language]
