Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
NumberModuloAutomaton.h
Go to the documentation of this file.
1
6/*
7 * This file is part of Algorithms library toolkit.
8 * Copyright (C) 2017 Jan Travnicek (jan.travnicek@fit.cvut.cz)
9
10 * Algorithms library toolkit is free software: you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation, either version 3 of the License, or
13 * (at your option) any later version.
14
15 * Algorithms library toolkit is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
19
20 * You should have received a copy of the GNU General Public License
21 * along with Algorithms library toolkit. If not, see <http://www.gnu.org/licenses/>.
22 */
23
24#pragma once
25
26#include <automaton/FSM/DFA.h>
27
28namespace automaton {
29
30namespace generate {
31
36public:
44 static automaton::DFA < std::string, unsigned > generate ( unsigned base, unsigned modulo, unsigned result_modulo );
45};
46
47} /* namespace generate */
48
49} /* namespace automaton */
50
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Definition: NumberModuloAutomaton.h:35
static automaton::DFA< std::string, unsigned > generate(unsigned base, unsigned modulo, unsigned result_modulo)
Definition: NumberModuloAutomaton.cpp:12
Definition: ToGrammar.h:31