Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
|
#include <InfiniteLanguage.h>
Static Public Member Functions | |
template<class T > requires isDFA < T > || isNFA < T > | |
static bool | infinite (const T &fsm) |
Determine whether language defined by DFA is infinite.
|
static |
Detects whether the language accepted by the automaton is finite or infinite.
@T the type of tested automaton
fsm | automaton |