diff --git a/alib2data/src/automaton/FSM/CompactNFA.h b/alib2data/src/automaton/FSM/CompactNFA.h
index 1f7cc11c4df54bd9205ccc582492a94047292e79..d71a4149cd9b3a44d1b91e374c80cab5ffd67dd9 100644
--- a/alib2data/src/automaton/FSM/CompactNFA.h
+++ b/alib2data/src/automaton/FSM/CompactNFA.h
@@ -60,11 +60,12 @@ class InitialState;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T*, and P(Q) is a powerset of states,
  * I (InitialState) = initial state,
+ * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T*, and P(Q) is a powerset of states,
+ * F (FinalStates) = set of final states
  *
  * \tparam SymbolType used for the terminal alphabet
  * \tparam StateType used to the states, and the initial state of the automaton.
diff --git a/alib2data/src/automaton/FSM/DFA.h b/alib2data/src/automaton/FSM/DFA.h
index 49ad5b19a6282f480322366a350cc8f774784edf..5a7dc73779d9aee2cbbec729c06e00e3ef834c5b 100644
--- a/alib2data/src/automaton/FSM/DFA.h
+++ b/alib2data/src/automaton/FSM/DFA.h
@@ -57,11 +57,12 @@ class InitialState;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> B, where A, B \in Q and a \in T,
  * I (InitialState) = initial state,
+ * \delta = transition function of the form A \times a -> B, where A, B \in Q and a \in T,
+ * F (FinalStates) = set of final states
  *
  * Note that target state of a transition is required.
  * This class is used to store minimal, total, ... variants of deterministic finite automata.
diff --git a/alib2data/src/automaton/FSM/EpsilonNFA.h b/alib2data/src/automaton/FSM/EpsilonNFA.h
index b39ff81303d4b25f049d4d8acf8c7922b3bafa0a..3dfa7f708536b5d5bc4ab3e3e2c504c34685489f 100644
--- a/alib2data/src/automaton/FSM/EpsilonNFA.h
+++ b/alib2data/src/automaton/FSM/EpsilonNFA.h
@@ -60,11 +60,12 @@ class InitialState;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T \cup \{\epsilon\}, and P(Q) is a powerset of states,
  * I (InitialState) = initial state,
+ * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T \cup \{\epsilon\}, and P(Q) is a powerset of states,
+ * F (FinalStates) = set of final states
  *
  * \tparam SymbolType used for the terminal alphabet
  * \tparam EpsilonType used for the epislon in the automaton.
diff --git a/alib2data/src/automaton/FSM/ExtendedNFA.h b/alib2data/src/automaton/FSM/ExtendedNFA.h
index 529117ac961622e9069aefc2225b50f85ee85ea4..faee7aff088b8246f26bd1ca5d583987e093e58a 100644
--- a/alib2data/src/automaton/FSM/ExtendedNFA.h
+++ b/alib2data/src/automaton/FSM/ExtendedNFA.h
@@ -63,11 +63,12 @@ class InitialState;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in RegExpsOver(T), and P(Q) is a powerset of states,
  * I (InitialState) = initial state,
+ * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in RegExpsOver(T), and P(Q) is a powerset of states,
+ * F (FinalStates) = set of final states
  *
  * \tparam SymbolType used for the terminal alphabet
  * \tparam StateType used to the states, and the initial state of the automaton.
diff --git a/alib2data/src/automaton/FSM/MultiInitialStateNFA.h b/alib2data/src/automaton/FSM/MultiInitialStateNFA.h
index b4c87def1f335ae4872b01dcdeb6041f6792c36b..3719306e883aea47c303fa9a06a03ce341549e70 100644
--- a/alib2data/src/automaton/FSM/MultiInitialStateNFA.h
+++ b/alib2data/src/automaton/FSM/MultiInitialStateNFA.h
@@ -56,11 +56,12 @@ class InitialStates;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T, and P(Q) is a powerset of states,
  * I (InitialState) = finite set of initial states,
+ * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T, and P(Q) is a powerset of states,
+ * F (FinalStates) = set of final states
  *
  * \tparam SymbolType used for the terminal alphabet
  * \tparam StateType used to the states, and the initial state of the automaton.
diff --git a/alib2data/src/automaton/FSM/NFA.h b/alib2data/src/automaton/FSM/NFA.h
index e49cd354ec0f4a0751e7292210af8560b40f3bf5..1a2ac1ac415ce343d935edb36f1563662add2d3a 100644
--- a/alib2data/src/automaton/FSM/NFA.h
+++ b/alib2data/src/automaton/FSM/NFA.h
@@ -54,11 +54,12 @@ class InitialState;
 
  * \details
  * Definition is classical definition of finite automata.
- * A = (Q, T, I, \delta),
+ * A = (Q, T, I, \delta, F),
  * Q (States) = nonempty finite set of states,
  * T (TerminalAlphabet) = finite set of terminal symbols - having this empty won't let automaton do much though,
- * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T, and P(Q) is a powerset of states,
  * I (InitialState) = initial state,
+ * \delta = transition function of the form A \times a -> P(Q), where A \in Q, a \in T, and P(Q) is a powerset of states,
+ * F (FinalStates) = set of final states
  *
  * \tparam SymbolType used for the terminal alphabet
  * \tparam StateType used to the states, and the initial state of the automaton.