fix documentation of regexps

alib2data/src/regexp/formal/FormalRegExp.h

@@ -53,7 +53,7 @@ class GeneralAlphabet;
  * Formal regular expression represents regular expression where nodes of concatenation and alternation have exactly two children. Describes regular languages.
  * \details
- * Definition is classical definition of finite automata.
+ * Definition is unbounded definition of regular expressions.
  * E = (T, C),
  * T (Alphabet) = finite set of terminal symbols
  * C (Content) = representation of the regular expression
@@ -156,7 +156,7 @@ public:
 	 *
 	 * \param other the other instance
 	 *
-	 * \returns the actual relation between two by type same automata instances
+	 * \returns the actual relation between two by type same expression instances
 	 */
 	int compare ( const FormalRegExp & other ) const;

alib2data/src/regexp/unbounded/UnboundedRegExp.h

@@ -53,7 +53,7 @@ class GeneralAlphabet;
  * Unbounded regular expression represents regular expression where nodes of concatenation and alternation can have any number of children. Describes regular languages.
  * \details
- * Definition is classical definition of finite automata.
+ * Definition is unbounded definition of regular expressions.
  * E = (T, C),
  * T (Alphabet) = finite set of terminal symbols
  * C (Content) = representation of the regular expression
@@ -156,7 +156,7 @@ public:
 	 *
 	 * \param other the other instance
 	 *
-	 * \returns the actual relation between two by type same automata instances
+	 * \returns the actual relation between two by type same expression instances
 	 */
 	int compare ( const UnboundedRegExp & other ) const;