\begin{theindex} \item \texttt { MinimalAutomaton}, \hyperpage{35} \item \texttt { StarRatExp}, \hyperpage{26} \indexspace \item \texttt {AccessibleAutomaton}, \hyperpage{36} \item \texttt {AccessibleStates}, \hyperpage{36} \item \texttt {AddInverseEdgesToInverseAutomaton}, \hyperpage{16} \item \texttt {AlphabetOfAutomaton}, \hyperpage{13} \item \texttt {AlphabetOfAutomatonAsList}, \hyperpage{13} \item \texttt {AlphabetOfRatExp}, \hyperpage{25} \item \texttt {AlphabetOfRatExpAsList}, \hyperpage{25} \item \texttt {AreDisjointLang}, \hyperpage{31} \item \texttt {AreEqualLang}, \hyperpage{30} \item \texttt {AreEquivAut}, \hyperpage{30} \item \texttt {AutoConnectedComponents}, \hyperpage{43} \item \texttt {AutoIsAcyclicGraph}, \hyperpage{45} \item \texttt {Automaton}, \hyperpage{9} \item \texttt {AutomatonAllPairsPaths}, \hyperpage{37} \item \texttt {AutomatonToRatExp }, \hyperpage{28} \item \texttt {AutoVertexDegree}, \hyperpage{42} \item \texttt {AutToRatExp}, \hyperpage{28} \indexspace \item \texttt {CopyAutomaton}, \hyperpage{17} \item \texttt {CopyRatExp}, \hyperpage{26} \indexspace \item \texttt {DiGraphToRelation}, \hyperpage{44} \item \texttt {DrawAutomata}, \hyperpage{48} \item \texttt {DrawAutomaton}, \hyperpage{46} \item \texttt {DrawGraph}, \hyperpage{48} \item \texttt {DrawSCCAutomaton}, \hyperpage{48} \indexspace \item \texttt {EpsilonCompactedAut}, \hyperpage{33} \item \texttt {EpsilonToNFA}, \hyperpage{32} \item \texttt {EpsilonToNFASet}, \hyperpage{32} \indexspace \item \texttt {FAtoRatExp}, \hyperpage{28} \item \texttt {FinalStatesOfAutomaton}, \hyperpage{14} \item \texttt {FiniteRegularLanguageToListOfWords}, \hyperpage{39} \item \texttt {FlowerAutomaton}, \hyperpage{51} \item \texttt {FoldFlowerAutomaton}, \hyperpage{51} \item \texttt {FuseSymbolsAut}, \hyperpage{34} \indexspace \item \texttt {GeneratorsToListRepresentation}, \hyperpage{50} \item \texttt {GeodesicTreeOfInverseAutomaton}, \hyperpage{52} \item \texttt {GraphStronglyConnectedComponents}, \hyperpage{43} \indexspace \item \texttt {InitialStatesOfAutomaton}, \hyperpage{14} \item \texttt {IntersectionAutomaton}, \hyperpage{37} \item \texttt {IntersectionLanguage}, \hyperpage{37} \item \texttt {InverseAutomatonToGenerators}, \hyperpage{52} \item \texttt {IsAutomaton}, \hyperpage{11} \item \texttt {IsContainedLang}, \hyperpage{31} \item \texttt {IsDenseAutomaton}, \hyperpage{15} \item \texttt {IsDeterministicAutomaton}, \hyperpage{11} \item \texttt {IsEmptyLang}, \hyperpage{30} \item \texttt {IsEpsilonAutomaton}, \hyperpage{11} \item \texttt {IsFiniteRegularLanguage}, \hyperpage{39} \item \texttt {IsFullLang}, \hyperpage{30} \item \texttt {IsInverseAutomaton}, \hyperpage{16} \item \texttt {IsNonDeterministicAutomaton}, \hyperpage{11} \item \texttt {IsPermutationAutomaton}, \hyperpage{16} \item \texttt {IsRationalExpression}, \hyperpage{24} \item \texttt {IsRecognizedByAutomaton}, \hyperpage{16} \item \texttt {IsReversibleAutomaton}, \hyperpage{17} \indexspace \item \texttt {ListOfWordsToAutomaton}, \hyperpage{39} \item \texttt {ListPermutedAutomata}, \hyperpage{19} \item \texttt {ListSinkStatesAut}, \hyperpage{18} \item \texttt {ListToGeneratorsRepresentation}, \hyperpage{50} \indexspace \item \texttt {MinimalizedAut}, \hyperpage{35} \item \texttt {MSccAutomaton}, \hyperpage{44} \indexspace \item \texttt {NFAtoDFA}, \hyperpage{34} \item \texttt {NormalizedAutomaton}, \hyperpage{19} \item \texttt {NullCompletionAutomaton}, \hyperpage{17} \item \texttt {NumberStatesOfAutomaton}, \hyperpage{15} \indexspace \item \texttt {PermutedAutomaton}, \hyperpage{19} \item \texttt {ProductAutomaton}, \hyperpage{20} \item \texttt {ProductOfLanguages}, \hyperpage{21} \item \texttt {ProductRatExp}, \hyperpage{26} \indexspace \item \texttt {RandomAutomaton}, \hyperpage{12} \item \texttt {RandomDiGraph}, \hyperpage{42} \item \texttt {RandomRatExp}, \hyperpage{24} \item \texttt {RatExpOnnLetters}, \hyperpage{23} \item \texttt {RatExpToAut}, \hyperpage{29} \item \texttt {RatExpToAutomaton}, \hyperpage{29} \item \texttt {RatExpToNDAut}, \hyperpage{28} \item rational expressions, \hyperpage{23} \item \texttt {RationalExpression}, \hyperpage{23} \item \texttt {ReducedNFA}, \hyperpage{33} \item \texttt {RemovedSinkStates}, \hyperpage{18} \item \texttt {ReversedAutomaton}, \hyperpage{18} \item \texttt {ReversedGraph}, \hyperpage{42} \indexspace \item \texttt {SetFinalStatesOfAutomaton}, \hyperpage{15} \item \texttt {SetInitialStatesOfAutomaton}, \hyperpage{14} \item \texttt {SizeRatExp}, \hyperpage{24} \item \texttt {String}, \hyperpage{12} \item \texttt {SubgroupGenToInvAut}, \hyperpage{51} \item \texttt {SyntacticSemigroupAut}, \hyperpage{22} \item \texttt {SyntacticSemigroupLang}, \hyperpage{22} \indexspace \item \texttt {TransitionMatrixOfAutomaton}, \hyperpage{14} \item \texttt {TransitionSemigroup}, \hyperpage{21} \indexspace \item \texttt {UnderlyingGraphOfAutomaton}, \hyperpage{44} \item \texttt {UnderlyingMultiGraphOfAutomaton}, \hyperpage{43} \item \texttt {UnionAutomata}, \hyperpage{20} \item \texttt {UnionRatExp}, \hyperpage{26} \item \texttt {UsefulAutomaton}, \hyperpage{35} \indexspace \item \texttt {VertexInDegree}, \hyperpage{42} \item \texttt {VertexOutDegree}, \hyperpage{42} \end{theindex}