Awali
Another Weighted Automata library
eval.hh
Go to the documentation of this file.
1 // This file is part of Awali.
2 // Copyright 2016-2022 Sylvain Lombardy, Victor Marsault, Jacques Sakarovitch
3 //
4 // Awali is a free software: you can redistribute it and/or modify
5 // it under the terms of the GNU General Public License as published by
6 // the Free Software Foundation, either version 3 of the License, or
7 // (at your option) any later version.
8 //
9 // This program is distributed in the hope that it will be useful,
10 // but WITHOUT ANY WARRANTY; without even the implied warranty of
11 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 // GNU General Public License for more details.
13 //
14 // You should have received a copy of the GNU General Public License
15 // along with this program. If not, see <http://www.gnu.org/licenses/>.
16 
17 #ifndef DYN_MODULES_EVAL_HH
18 #define DYN_MODULES_EVAL_HH
19 
20 #include <map>
22 
23 //Only for lal
24 
25 namespace awali {
26  namespace dyn {
27 
34 
35 
42  std::map<any_t, weight_t> enumerate(automaton_t aut, unsigned max);
43 
44 
51  std::map<any_t, weight_t> shortest(automaton_t aut, unsigned max);
52 
53  }
54 }//end of ns awali::dyn
55 
56 #endif
An automaton_t is essentially a shared pointer to an abstract_automaton_t, but also contains static f...
Definition: automaton.hh:93
std::map< any_t, weight_t > enumerate(automaton_t aut, unsigned max)
Gives the weight associated with each word shorter than max by aut.
weight_t eval(automaton_t aut, any_t word)
Computes the weight associated with word by aut.
std::map< any_t, weight_t > shortest(automaton_t aut, unsigned max)
Gives the shortest , returns an empty map if no such word is shorter than max.
ATTRIBUTE_CONST int max(int a, int b)
Definition: arith.hh:54
Main namespace of Awali.
Definition: ato.hh:22
Structure used to erase the type of labels/weights at the dyn layer.
Definition: any.hh:59