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
MinimizeBrzozowski.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#include <automaton/FSM/NFA.h>
29
32
33namespace automaton {
34
35namespace simplify {
36
48public:
59 template < class SymbolType, class StateType >
61
65 template < class SymbolType, class StateType >
67};
68
69template < class SymbolType, class StateType >
72}
73
74template < class SymbolType, class StateType >
77}
78
79} /* namespace simplify */
80
81} /* namespace automaton */
82
Deterministic finite automaton. Accepts regular languages.
Definition: DFA.h:71
Nondeterministic finite automaton. Accepts regular languages.
Definition: NFA.h:66
static automaton::DFA< SymbolType, StateType > determinize(const automaton::DFA< SymbolType, StateType > &automaton)
Definition: Determinize.h:276
Definition: MinimizeBrzozowski.h:47
static automaton::DFA< SymbolType, ext::set< ext::set< StateType > > > minimize(const automaton::DFA< SymbolType, StateType > &dfa)
Definition: MinimizeBrzozowski.h:70
static automaton::MultiInitialStateNFA< SymbolType, StateType > convert(const automaton::DFA< SymbolType, StateType > &automaton)
Definition: Reverse.h:64
Definition: ToGrammar.h:31