commit 32ddbec5e6f091a4e390719ee346ff9148656700
parent 0236ba408f78cf452a4fd00b445e6e3198cf789c
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Fri, 14 Feb 2025 09:32:41 +0100
commit with codex
Diffstat:
5 files changed, 23 insertions(+), 2 deletions(-)
diff --git a/all_pairs_shortest_path b/all_pairs_shortest_path
@@ -28,3 +28,5 @@ Beware: APSP can also mean "All pairs suffix prefix", cf [gusfield1992efficient]
Up: [shortest_path], [fine_grained_complexity_problems]
See also: [reachability_all_pairs]
+
+Aliases: APSP
diff --git a/automata_alternating b/automata_alternating
@@ -0,0 +1,11 @@
+# Automata alternating
+
+An [automaton] where the [states] can be [existential_states] or [universal_states]
+
+Generalizes [NFAs]
+
+Can be seen as an [arena] in [game_theory]
+
+Up: [automata_types]
+
+Aliases: alternating automaton, alternating automata
diff --git a/matrix b/matrix
@@ -34,4 +34,8 @@
- [matrix_multiplication]
- [matrix_mortality]
+## [Generalizations]
+
+- [tensor]
+
Up: [mathematics]
diff --git a/regular_expression_extensions b/regular_expression_extensions
@@ -1,7 +1,8 @@
# Regular expression extensions
-- [regular_expression_conjunction]
-- [regular_expression_negation]
+- [regular_expression_extended]
+ - [regular_expression_conjunction]
+ - [regular_expression_negation]
- [capture_variables]
- [regex], with [back_references]
- see [freydenberger2019deterministic]
diff --git a/state b/state
@@ -4,6 +4,9 @@ An [automaton] consists of a set of states, which is generally finite.
- [initial_state]
- [final_state]
+- for [alternating_automata]
+ - [existential_state]
+ - [universal_state]
Up: [automata_concepts]
