From 397820c64f1c657b468ecc609ed2806c83bc3c8c Mon Sep 17 00:00:00 2001
From: Ondrej Storc <storcond@fit.cvut.cz>
Date: Wed, 22 Jan 2025 15:03:16 +0100
Subject: [PATCH] algo: Fix naming of algorithms in UI

Changing 'inaccessible' to 'unreachable' to be consistent with BI-AAG
---
 alib2algo/src/automaton/simplify/Trim.cpp | 20 ++++++++++----------
 1 file changed, 10 insertions(+), 10 deletions(-)

diff --git a/alib2algo/src/automaton/simplify/Trim.cpp b/alib2algo/src/automaton/simplify/Trim.cpp
index f418542306..084ed6086b 100644
--- a/alib2algo/src/automaton/simplify/Trim.cpp
+++ b/alib2algo/src/automaton/simplify/Trim.cpp
@@ -12,52 +12,52 @@
 
 namespace {
 
-auto TrimDFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::DFA<>, const automaton::DFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimDFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::DFA<>, const automaton::DFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::NFA<>, const automaton::NFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::NFA<>, const automaton::NFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimMultiInitialStateNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::MultiInitialStateNFA<>, const automaton::MultiInitialStateNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimMultiInitialStateNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::MultiInitialStateNFA<>, const automaton::MultiInitialStateNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimEpsilonNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::EpsilonNFA<>, const automaton::EpsilonNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimEpsilonNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::EpsilonNFA<>, const automaton::EpsilonNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimCompactNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::CompactNFA<>, const automaton::CompactNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimCompactNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::CompactNFA<>, const automaton::CompactNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimExtendedNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ExtendedNFA<>, const automaton::ExtendedNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimExtendedNFA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ExtendedNFA<>, const automaton::ExtendedNFA<>&>(automaton::simplify::Trim::trim, "fsm").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fsm finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fsm");
 
-auto TrimDFTA = registration::AbstractRegister<automaton::simplify::Trim, automaton::DFTA<>, const automaton::DFTA<>&>(automaton::simplify::Trim::trim, "fta").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimDFTA = registration::AbstractRegister<automaton::simplify::Trim, automaton::DFTA<>, const automaton::DFTA<>&>(automaton::simplify::Trim::trim, "fta").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fta finite tree automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fta");
 
-auto TrimNFTA = registration::AbstractRegister<automaton::simplify::Trim, automaton::NFTA<>, const automaton::NFTA<>&>(automaton::simplify::Trim::trim, "fta").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimNFTA = registration::AbstractRegister<automaton::simplify::Trim, automaton::NFTA<>, const automaton::NFTA<>&>(automaton::simplify::Trim::trim, "fta").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param fta finite automaton or finite tree automaton to trim\n\
 @return the trimmed automaton equivalent to @p fta");
 
-auto TrimAFDZA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ArcFactoredDeterministicZAutomaton<>, const automaton::ArcFactoredDeterministicZAutomaton<>&>(automaton::simplify::Trim::trim, "afdza").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimAFDZA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ArcFactoredDeterministicZAutomaton<>, const automaton::ArcFactoredDeterministicZAutomaton<>&>(automaton::simplify::Trim::trim, "afdza").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param afdza deterministic arc factored z-automaton\n\
 @return the trimmed automaton equivalent to @p afdza");
 
-auto TrimAFNZA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ArcFactoredNondeterministicZAutomaton<>, const automaton::ArcFactoredNondeterministicZAutomaton<>&>(automaton::simplify::Trim::trim, "afdza").setDocumentation("Removes inaccessible and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
+auto TrimAFNZA = registration::AbstractRegister<automaton::simplify::Trim, automaton::ArcFactoredNondeterministicZAutomaton<>, const automaton::ArcFactoredNondeterministicZAutomaton<>&>(automaton::simplify::Trim::trim, "afdza").setDocumentation("Removes unreachable and useless states from the given automaton. Uses first the @sa UselessStatesRemover and next @sa UnreachableStatesRemover in the process.\n\
 \n\
 @param afdza deterministic arc factored z-automaton\n\
 @return the trimmed automaton equivalent to @p afdza");
-- 
GitLab