Awali
Another Weighted Automata library
|
The weighted determinization of weighted automaton. More...
#include <determinize.hxx>
Data Structures | |
struct | stateset |
An output state is a list of weighted input states. More... | |
Public Types | |
using | automaton_t = Aut |
using | label_t = label_t_of< automaton_t > |
using | state_name_t = typename state_nameset_t::value_t |
using | state_nameset_t = polynomialset< context< stateset, weightset_t > > |
using | weight_t = weight_t_of< automaton_t > |
using | weightset_t = weightset_t_of< automaton_t > |
Public Member Functions | |
detweighted_algo_impl (const automaton_t &a, int lim=-1) | |
Build the weighted determinizer. More... | |
automaton_t | operator() () |
template<typename Pred > | |
automaton_t | operator() (Pred pred) |
The determinization of weighted automaton the state is added to the result only if the predicate pred is true, otherwise it is replace by the 'unknown' state. More... | |
The weighted determinization of weighted automaton.
This function only applies to true finite state machine. The result is a deterministic automaton where the weight of the word is given by the final function. If the semiring is not locally finite, the termination is not assured.
Aut | an weighted automaton type. |
using awali::sttc::internal::detweighted_algo_impl< Aut >::automaton_t = Aut |
using awali::sttc::internal::detweighted_algo_impl< Aut >::label_t = label_t_of<automaton_t> |
using awali::sttc::internal::detweighted_algo_impl< Aut >::state_name_t = typename state_nameset_t::value_t |
using awali::sttc::internal::detweighted_algo_impl< Aut >::state_nameset_t = polynomialset<context<stateset, weightset_t> > |
using awali::sttc::internal::detweighted_algo_impl< Aut >::weight_t = weight_t_of<automaton_t> |
using awali::sttc::internal::detweighted_algo_impl< Aut >::weightset_t = weightset_t_of<automaton_t> |
awali::sttc::internal::detweighted_algo_impl< Aut >::detweighted_algo_impl | ( | const automaton_t & | a, |
int | lim = -1 |
||
) |
Build the weighted determinizer.
a | the weighted automaton to determinize |
lim | the depth of the determinisation; -1 means infinity |
automaton_t awali::sttc::internal::detweighted_algo_impl< Aut >::operator() | ( | ) |
automaton_t awali::sttc::internal::detweighted_algo_impl< Aut >::operator() | ( | Pred | pred | ) |
The determinization of weighted automaton the state is added to the result only if the predicate pred
is true, otherwise it is replace by the 'unknown' state.
pred | a lambda state_name_t -> bool |
Pred | the type of pred |