fix documentation of FSMs add finite state set

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.

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.

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.

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.

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.

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.