17 #ifndef DYN_FACTORIES_HH
18 #define DYN_FACTORIES_HH
74 automaton_t divkbaseb(
unsigned k,
unsigned b,
const std::string& alphabet=
"auto",
const std::string& semiring=
"B");
98 automaton_t double_ring(
unsigned n,
const std::vector<unsigned>& finals,
const std::string& alphabet,
const std::string& semiring=
"B");
149 automaton_t cerny(
unsigned n,
const std::string& alphabet,
const std::string& semiring=
"B");
An automaton_t is essentially a shared pointer to an abstract_automaton_t, but also contains static f...
Definition: automaton.hh:93
automaton_t cerny(unsigned n, const std::string &alphabet, const std::string &semiring="B")
Returns an automaton with n states.
automaton_t divkbaseb(unsigned k, unsigned b, const std::string &alphabet="auto", const std::string &semiring="B")
Returns an automaton which recognizes numbers in base b which are multiple of k.
automaton_t n_ultimate(unsigned n, const std::string &alphabet, const std::string &semiring="B")
Returns an automaton which recognizes words with a specific n-ultimate letter.
automaton_t double_ring(unsigned n, const std::vector< unsigned > &finals, const std::string &alphabet, const std::string &semiring="B")
Returns a double ring automaton with n states.
automaton_t witness(unsigned n, const std::string &alphabet, const std::string &semiring="B")
Returns an automaton with n states.
automaton_t ladybird(unsigned n, const std::string &alphabet, const std::string &semiring="B")
Returns a "ladybird" automaton with n states.
automaton_t int_divkbaseb(unsigned k, unsigned b, const std::string &semiring="B")
returns an automaton which recognizes numbers in base b which are multiple of k
Main namespace of Awali.
Definition: ato.hh:22