Z automata merge

ZAutomata auxiliary algorithms and various simplifications and improvements.

Main changes: EpsilonNFTA datatype and its conversion to NFTA, RTE to EpsilonNFTA algorithm, minimization and reduction of ZAutomata.

assigned to @travnja3

added 25 commits

• 2e45e35d - aux: dot converter of arc factored ZAutomata
• 80763d44 - data: isNAFZA and isDAFZA traits
• e770ccdd - algo: useful states for Z-Automata
• 3f70d408 - algo: reachable states for Z-Automata
• 063df420 - algo: unreachable states remover for Z-Automata
• ed5db83a - algo: useless states remover for Z-Automata
• 7ecfefd0 - algo: trim for Z-Automata
• 75807bb9 - algo: trim of nondeterministic zautomaton
• 12108ba0 - examples: another zautomaton example
• 89eccce5 - data: add epsilon NFTA
• c0bc3367 - algo: remove not-supposed-to-exist declaration from Glushkov follow
• 32797a21 - algo: RTE to EpsilonNFTA by Thompson's like method
• b21a8af8 - algo: epsilon closure for EpsilonNFTA
• 09f60bb3 - aux: EpsilonNFTA to dot converter
• 35cdf2c6 - algo: Epsilon exclusion for EpsilonNFTA
• 3ab46e6a - tests: RTE to Epsilon FTA test
• 6236c04b - algo: optimize EpsilonClosure code
• b6316249 - algo: simplify regular equations solver
• 8bf73ebe - algo: simplify infinite language
• 9f3393fa - algo: map to bool -> set in automata generators
• 3317d8bd - algo: simplify UnrankedPatternMatchingAutomaton
• 9b9c8451 - aux: convert ZAutomaton to Dot
• c2712702 - fixup b254c4ff
• 4ce555eb - data: unify AF{D,N}ZA vs {D,N}AFZA to AF{D,N}ZA
• 068e1faa - data: update documentation of various TA

Compare with previous version

resolved all discussions

assigned to @peckato1

resolved all discussions

added 29 commits

• ddb8047e - backup: full g++-11 adaptation patch
• 13bc7697 - algo: ZAutomaton to PDA
• 7405112e - algo: ZAutomata bisimulation
• 834c8842 - algo: add missing header to ForwardBisimulation
• af5261fa - xml: fix alphabet node of ZAutomata
• a5aeae8e - aux: dot converter of arc factored ZAutomata
• 13263882 - data: isNAFZA and isDAFZA traits
• b3e9ee4f - algo: useful states for Z-Automata
• fa9d5aa0 - algo: reachable states for Z-Automata
• f03f3751 - algo: unreachable states remover for Z-Automata
• 58b6b63d - algo: useless states remover for Z-Automata
• 7bf00ad4 - algo: trim for Z-Automata
• 268c4644 - algo: trim of nondeterministic zautomaton
• 06806de2 - examples: another zautomaton example
• 024aba6e - data: add epsilon NFTA
• 4a661a0e - algo: remove not-supposed-to-exist declaration from Glushkov follow
• 867cbcd2 - algo: RTE to EpsilonNFTA by Thompson's like method
• 6cc10d67 - algo: epsilon closure for EpsilonNFTA
• 6de6b6ed - aux: EpsilonNFTA to dot converter
• c5d66d65 - algo: Epsilon exclusion for EpsilonNFTA
• caa3a2f0 - tests: RTE to Epsilon FTA test
• 7cb66ea7 - algo: optimize EpsilonClosure code
• 88d589df - algo: simplify regular equations solver
• 5c2a5d71 - algo: simplify infinite language
• 9972605b - algo: map to bool -> set in automata generators
• be55a954 - algo: simplify UnrankedPatternMatchingAutomaton
• c2b84352 - aux: convert ZAutomaton to Dot
• 8e1a82aa - data: unify AF{D,N}ZA vs {D,N}AFZA to AF{D,N}ZA
• 07593cb0 - data: update documentation of various TA

Compare with previous version

enabled an automatic merge when the pipeline for 07593cb0 succeeds

canceled the automatic merge

added 28 commits

• cef792ef - algo: ZAutomaton to PDA
• 61460230 - algo: ZAutomata bisimulation
• f6f78729 - algo: add missing header to ForwardBisimulation
• 4f6005f1 - xml: fix alphabet node of ZAutomata
• b42b0ca7 - aux: dot converter of arc factored ZAutomata
• 954b47a7 - data: isNAFZA and isDAFZA traits
• de7830e2 - algo: useful states for Z-Automata
• 5400f6be - algo: reachable states for Z-Automata
• 7889f49f - algo: unreachable states remover for Z-Automata
• 051e080d - algo: useless states remover for Z-Automata
• 45eeb955 - algo: trim for Z-Automata
• 6ac9daa4 - algo: trim of nondeterministic zautomaton
• c11a19e9 - examples: another zautomaton example
• dfedadeb - data: add epsilon NFTA
• 3ae215b2 - algo: remove not-supposed-to-exist declaration from Glushkov follow
• a03f9164 - algo: RTE to EpsilonNFTA by Thompson's like method
• 05374275 - algo: epsilon closure for EpsilonNFTA
• 01a6747b - aux: EpsilonNFTA to dot converter
• 2a1d4873 - algo: Epsilon exclusion for EpsilonNFTA
• 89e981cd - tests: RTE to Epsilon FTA test
• 37fa8e73 - algo: optimize EpsilonClosure code
• 9c5a13fe - algo: simplify regular equations solver
• f458ab5b - algo: simplify infinite language
• 225ad4bb - algo: map to bool -> set in automata generators
• ea7a89ef - algo: simplify UnrankedPatternMatchingAutomaton
• 3f6c9cae - aux: convert ZAutomaton to Dot
• e3233cbe - data: unify AF{D,N}ZA vs {D,N}AFZA to AF{D,N}ZA
• 1dbb5f7c - data: update documentation of various TA

Compare with previous version

enabled an automatic merge when the pipeline for 1dbb5f7c succeeds

merged