Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Concepts
MinimizeGenerator.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <automaton/FSM/DFA.h>
9
10namespace automaton {
11
12namespace generate {
13
15public:
16 static automaton::DFA < std::string, unsigned > generateMinimizeDFA ( size_t statesMinimal, size_t statesDuplicates, size_t statesUnreachable, size_t statesUseless, size_t alphabetSize, bool randomizedAlphabet, double density, size_t expectedSteps );
17};
18
19} /* namespace generate */
20
21} /* namespace automaton */
22
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Definition: MinimizeGenerator.h:14
static automaton::DFA< std::string, unsigned > generateMinimizeDFA(size_t statesMinimal, size_t statesDuplicates, size_t statesUnreachable, size_t statesUseless, size_t alphabetSize, bool randomizedAlphabet, double density, size_t expectedSteps)
Definition: MinimizeGenerator.cpp:20
Definition: ToGrammar.h:31