Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Toggle main menu visibility
Main Page
Modules
Namespaces
Namespace List
Namespace Members
All
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
q
r
s
t
u
v
w
Functions
a
b
c
d
e
f
g
h
i
k
l
m
n
o
p
r
s
t
u
v
w
Variables
a
c
d
e
f
g
i
n
q
r
s
v
w
Typedefs
b
c
d
f
i
l
n
p
r
s
t
u
Enumerations
Enumerator
Concepts
Data Structures
Data Structures
Data Structure Index
Class Hierarchy
Data Fields
All
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
~
Functions
a
b
c
d
e
f
g
h
i
j
k
l
m
n
o
p
q
r
s
t
u
v
w
x
~
Variables
a
c
d
e
f
h
i
l
m
n
o
p
r
s
t
v
w
Typedefs
c
d
e
f
i
n
o
p
r
s
t
v
w
Enumerations
Related Functions
a
b
f
n
o
p
s
t
u
v
Files
File List
Globals
All
Functions
Typedefs
Macros
•
All
Data Structures
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Friends
Macros
Modules
Concepts
alib2algo
src
automaton
generate
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
28
namespace
automaton
{
29
30
namespace
generate {
31
35
class
NumberModuloAutomaton
{
36
public
:
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
DFA.h
automaton::DFA
Deterministic finite automaton. Accepts regular languages.
Definition:
DFA.h:71
automaton::generate::NumberModuloAutomaton
Definition:
NumberModuloAutomaton.h:35
automaton::generate::NumberModuloAutomaton::generate
static automaton::DFA< std::string, unsigned > generate(unsigned base, unsigned modulo, unsigned result_modulo)
Definition:
NumberModuloAutomaton.cpp:12
automaton
Definition:
ToGrammar.h:31
Generated on Mon Dec 27 2021 10:21:51 for Algorithms Library Toolkit by
1.9.2