Directory dependency graph for vaucanson/algorithms/:
Directories | |
| directory | internal |
Files | |
| file | accessible.hh [code] |
| Algorithms for accessible/coaccessible states computation. | |
| file | accessible.hxx [code] |
| file | aci_canonical.hh [code] |
| Declaration for the canonical() algorithm. | |
| file | aci_canonical.hxx [code] |
| file | aut_projection.hh [code] |
| Projections for automata that support it (it depends on the letter type). | |
| file | aut_projection.hxx [code] |
| file | aut_to_exp.hh [code] |
| This file provides converter from automaton to expression. | |
| file | aut_to_exp.hxx [code] |
| file | berry_sethi.hh [code] |
| Contains the declaration for the Berry-Sethi algorithm. | |
| file | berry_sethi.hxx [code] |
| file | brzozowski.hh [code] |
| Contains the declaration for the Brzozowski algorithm. | |
| file | brzozowski.hxx [code] |
| file | characteristic.hh [code] |
| Characteristic algorithm. | |
| file | characteristic.hxx [code] |
| file | complement.hh [code] |
| Complementation algorithm for Boolean automata. | |
| file | complement.hxx [code] |
| file | complete.hh [code] |
| Testing and building complete automata. | |
| file | complete.hxx [code] |
| file | composition_cover.hh [code] |
| Composition for normalized and sub-normalized transducers seen as automata over a free monoid product. | |
| file | composition_cover.hxx [code] |
| Composition (co-)cover algorithms for normalized and sub-normalized transducers seen as automaton over a free monoid. | |
| file | cut_up.hh [code] |
| Cut-up algorithm. | |
| file | cut_up.hxx [code] |
| Cut-up algorithm. | |
| file | derived_term_automaton.hh [code] |
| Provides a converter from expression to automaton based on derivatives. | |
| file | derived_term_automaton.hxx [code] |
| file | determinize.hh [code] |
| Boolean automata determinization. | |
| file | determinize.hxx [code] |
| file | domain.hh [code] |
| Domain algorithm. | |
| file | domain.hxx [code] |
| file | eps_removal.hh [code] |
| This files declares the backward and forward eps_removal algorithm. | |
| file | eps_removal.hxx [code] |
| file | eps_removal_sp.hh [code] |
| This files declares the backward and forward eps_removal algorithm. | |
| file | eps_removal_sp.hxx [code] |
| file | equivalent.hh [code] |
| This file contains the declarations for the are_equivalent() algorithm. | |
| file | equivalent.hxx [code] |
| file | eval.hh [code] |
| This file provides the evaluation of a word w.r.t an automaton. | |
| file | eval.hxx [code] |
| file | evaluation_fmp.hh [code] |
| Evaluation over normalized and sub-normalized transducers seen as automata over a free monoid product. | |
| file | evaluation_fmp.hxx [code] |
| file | evaluation_rw.hh [code] |
| Evaluation of an RW transducer over a realtime automaton. | |
| file | evaluation_rw.hxx [code] |
| file | extension.hh [code] |
| Declarations for extension(). | |
| file | extension.hxx [code] |
| file | factor.hh [code] |
| Compute an automaton which accepts any factor of the language accepted by the given automaton. | |
| file | factor.hxx [code] |
| file | finite_support_conversion.hh [code] |
| Conversion between finite support application types. | |
| file | finite_support_conversion.hxx [code] |
| file | fmp_to_rw.hh [code] |
| This file provides a transformation function that computes the Rational Weight transducer of a FMP automaton. | |
| file | fmp_to_rw.hxx [code] |
| file | image.hh [code] |
| Image projection for transducers. | |
| file | image.hxx [code] |
| file | infiltration.hh [code] |
| Declarations of infiltration(). | |
| file | infiltration.hxx [code] |
| file | initial_derivation.hh [code] |
| Declaration of the initial derivation visitor, used for smart_derivative_automaton. | |
| file | initial_derivation.hxx [code] |
| file | invert.hh [code] |
| Declarations of invert(). | |
| file | invert.hxx [code] |
| file | is_ambiguous.hh [code] |
| Test for ambiguity. | |
| file | is_ambiguous.hxx [code] |
| file | is_deterministic.hh [code] |
| Boolean automata determinization. | |
| file | is_deterministic.hxx [code] |
| file | is_empty.hh [code] |
| Declaration of is_empty(). | |
| file | is_empty.hxx [code] |
| file | is_ltl.hh [code] |
| Letter-to-letter feature testing. | |
| file | is_ltl.hxx [code] |
| file | is_normalized.hh [code] |
| Test for transducer normalization. | |
| file | is_normalized.hxx [code] |
| file | is_trim.hh [code] |
| Declaration of is_trim() | |
| file | is_trim.hxx [code] |
| file | is_useless.hh [code] |
| Declaration of is_useless(). | |
| file | is_useless.hxx [code] |
| file | isomorph.hh [code] |
| This files contains the declaration for the are_isomorphic() algorithm. | |
| file | isomorph.hxx [code] |
| file | krat_exp_cderivation.hh [code] |
| Declaration for the cderivate() algorithms. | |
| file | krat_exp_cderivation.hxx [code] |
| file | krat_exp_constant_term.hh [code] |
| Declaration for the constant_term() algorithm. | |
| file | krat_exp_constant_term.hxx [code] |
| file | krat_exp_derivation.hh [code] |
| Declaration for the derivate() algorithms. | |
| file | krat_exp_derivation.hxx [code] |
| file | krat_exp_expand.hh [code] |
| Expand a k-rational-expression. | |
| file | krat_exp_expand.hxx [code] |
| file | krat_exp_flatten.hh [code] |
| This file holds the declaration of the flatten() algorithm. | |
| file | krat_exp_flatten.hxx [code] |
| file | krat_exp_linearize.hh [code] |
| Declarations for the linearize() algorithm. | |
| file | krat_exp_linearize.hxx [code] |
| file | krat_exp_partial_derivation.hh [code] |
| Declarations for the partial_derivate() algorithm. | |
| file | krat_exp_partial_derivation.hxx [code] |
| file | krat_exp_realtime.hh [code] |
| Declarations of the realtime() algorithm for rational expressions. | |
| file | krat_exp_realtime.hxx [code] |
| file | letter_to_letter_composition.hh [code] |
| Undocumented stuff. | |
| file | letter_to_letter_composition.hxx [code] |
| file | ltl_to_pair.hh [code] |
| This file provides a transformation function that computes the pair letter automaton of an FMP automaton. | |
| file | ltl_to_pair.hxx [code] |
| file | minimization_hopcroft.hh [code] |
| This file provides minimization and quotient algorithms. | |
| file | minimization_hopcroft.hxx [code] |
| file | minimization_moore.hh [code] |
| This file containes the declaration of minimization_moore(). | |
| file | minimization_moore.hxx [code] |
| file | normalized.hh [code] |
| Thompson normalization operations. | |
| file | normalized.hxx [code] |
| file | normalized_composition.hh [code] |
| Composition for normalized and sub-normalized transducers seen as automata over a free monoid product. | |
| file | normalized_composition.hxx [code] |
Composition for normalized and sub-normalized transducers seen as automata over a free monoid product. | |
| file | one_eps_closure.hh [code] |
| This file declares the backward and forward one_eps_closure algorithm. | |
| file | one_eps_closure.hxx [code] |
| file | pair_to_fmp.hh [code] |
| This file provides a transformation function that computes the FMP transducer of a pair letter automaton. | |
| file | pair_to_fmp.hxx [code] |
| file | prefix.hh [code] |
| Compute an automaton which accepts any prefix of the language accepted by the given automaton. | |
| file | prefix.hxx [code] |
| file | product.hh [code] |
| Declarations of product(). | |
| file | product.hxx [code] |
| file | projection.hh [code] |
| Build FMP transducers from automata. | |
| file | projection.hxx [code] |
| file | realtime.hh [code] |
| General algorithms concerning realtime aspect of automata. | |
| file | realtime.hxx [code] |
| file | realtime_decl.hh [code] |
| Declaration of the realtime() function. | |
| file | realtime_decl.hxx [code] |
| file | reduce.hh [code] |
| This files declares the reduce algorithm. | |
| file | reduce.hxx [code] |
| file | rw_composition.hh [code] |
| Composition of two Rational-Weight transducers. | |
| file | rw_composition.hxx [code] |
| file | rw_to_fmp.hh [code] |
| This file provides a transformation function that computes the equivalent FMP automaton of a Rational Weight tranducer. | |
| file | rw_to_fmp.hxx [code] |
| file | search.hh [code] |
| Rational expression search in text. | |
| file | search.hxx [code] |
| file | shortest.hh [code] |
| Algorithms for enumeration of short words in a language. | |
| file | shortest.hxx [code] |
| file | shuffle.hh [code] |
| Declarations of shuffle(). | |
| file | shuffle.hxx [code] |
| file | standard.hh [code] |
| Several algorithms concerning standard automata. | |
| file | standard.hxx [code] |
| file | standard_of.hh [code] |
| This file provides a converter from expression to standard automaton. | |
| file | standard_of.hxx [code] |
| file | sub_automaton.hh [code] |
| This file provides the extraction of sub automaton. | |
| file | sub_automaton.hxx [code] |
| file | sub_normalize.hh [code] |
| Sub-normalization algorithm for FMP transducers. | |
| file | sub_normalize.hxx [code] |
| Sub-normalization algorithm for FMP transducers. | |
| file | suffix.hh [code] |
| Compute an automaton which accepts any suffix of the language accepted by the given automaton. | |
| file | suffix.hxx [code] |
| file | thompson.hh [code] |
| The thompson automaton. | |
| file | thompson.hxx [code] |
| file | algorithms/transpose.hh [code] |
| This file contains the function which transposes an automaton. | |
| file | algorithms/transpose.hxx [code] |
| file | trim.hh [code] |
| Declaration of useful_states() and trim(). | |
| file | trim.hxx [code] |
| file | universal.hh [code] |
| Universal automaton for Boolean rational languages. | |
| file | universal.hxx [code] |
