reglibcpp
2.0.0
A C++ implementation of models for regular languages
|
Contains the reg::nfa class definition. More...
Go to the source code of this file.
Classes | |
class | reg::nfa |
Represents nondeterministic finite automata with ε-moves. More... | |
struct | reg::nfa::hash_reference_string_const |
Provides std::unordered_set::hash_function for state_set. More... | |
struct | reg::nfa::equal_to_reference_string_const |
Provides std::unordered_set::key_eq for state_set. More... | |
Namespaces | |
reg | |
Where this library lives. | |
Functions | |
string | reg::findShortestWord (nfa const &n) |
Same as above for a UTF-8-encoded word. More... | |
u32string | reg::findShortestWord_ (nfa const &n) |
Searches the shortest UTF-32-encoded word accepted by a given NFA. More... | |