Sophie

Sophie

distrib > Mandriva > 2010.0 > i586 > media > contrib-release > by-pkgid > 91213ddcfbe7f54821d42c2d9e091326 > files > 489

gap-system-packages-4.4.12-5mdv2010.0.i586.rpm

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