commit 3814e17be281f2328661a2ae3d78936c5372499c
parent d6f4ace3acf9e624bbf82ae6fb08d3d37d3d1cfd
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Wed, 22 Apr 2026 14:51:33 +0200
commit with codex
Diffstat:
4 files changed, 18 insertions(+), 5 deletions(-)
diff --git a/counter_free_automata b/counter_free_automata
@@ -9,3 +9,5 @@ Such automata recognize the [aperiodic_languages]
Up: [automata_classes]
Aliases: automata counter-free, automata counter free, automaton counter free
+
+See also: [permutation_automaton]
diff --git a/inverse_automaton b/inverse_automaton
@@ -0,0 +1,7 @@
+# Inverse automaton
+
+A [DFA] where every letter defines a [partial_bijection] on the set of [states]
+
+Studied in [birget1994pspace]
+
+Up: [permutation_automaton]
diff --git a/matching b/matching
@@ -1,16 +1,16 @@
# Matching
-Structure in [graph] et [graph_bipartite]: a subset of edges where no two edges share a vertex
+Structure in [graphs] and [bipartite_graphs]: a subset of [edges] where no two [edges] share a common [vertex]
- [maximum_matching]
- [perfect_matching]
-Problems:
+[Computational_problems]:
- [matching_counting]
- [maximum_matching_counting]
-Algorithms [graph_algorithm]:
+[Graph_algorithms]:
- [hungarian_algorithm]
@@ -22,7 +22,7 @@ Variants:
Also the [linear_relaxation]: see [fractional_edge_packing]
-See also: [independent_set], [induced_matching], [graph_matching_covered], [deficiency]
+See also: [independent_set], [induced_matching], [graph_matching_covered], [deficiency], [partial_bijection]
Up: [graph_substructure]
diff --git a/permutation_automaton b/permutation_automaton
@@ -2,6 +2,10 @@
https://en.wikipedia.org/wiki/Permutation_automaton
-See also: [language_group]
+Generalization: [inverse_automaton]
+
+See also: [language_group], [Counter_free_automata]
Up: [automata], [permutation]
+
+Aliases: pure group automata, puregroup automata, pure group automaton, puregroup automaton, group automata, permutation automata, group automaton
