Namespaces |
namespace | faudes |
| libFAUDES resides within the namespace faudes.
|
Defines |
#define | FAUDES_REGULAR_H |
Functions |
void | faudes::LanguageUnionNonDet (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language union, nondeterministic version.
|
void | faudes::LanguageUnion (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language union, deterministic version.
|
void | faudes::LanguageUnion (const GeneratorVector &rGenVec, vGenerator &rResGen) |
| Language union.
|
void | faudes::LanguageIntersection (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language intersection.
|
void | faudes::LanguageIntersection (const GeneratorVector &rGenVec, vGenerator &rResGen) |
| Language intersection.
|
bool | faudes::EmptyLanguageIntersection (const vGenerator &rGen1, const vGenerator &rGen2) |
| Test for empty language intersection (same as Disjoind()).
|
bool | faudes::LanguageDisjoint (const vGenerator &rGen1, const vGenerator &rGen2) |
| Test whether two languages are disjoint.
|
void | faudes::Automaton (vGenerator &rGen) |
| Convert generator to automaton.
|
void | faudes::Automaton (vGenerator &rGen, const EventSet &rAlphabet) |
| Convert generator to automaton wrt specified alphabet.
|
void | faudes::LanguageComplement (vGenerator &rGen) |
| Language complement.
|
void | faudes::LanguageComplement (vGenerator &rGen, const EventSet &rAlphabet) |
| Language complement wrt specified alphabet.
|
void | faudes::LanguageComplement (const vGenerator &rGen, vGenerator &rRes) |
| Language Complement (uniform API wrapper).
|
void | faudes::LanguageComplement (const vGenerator &rGen, const EventSet &rSigma, vGenerator &rRes) |
| Language Complement (uniform API wrapper).
|
void | faudes::LanguageDifference (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language difference (set-theoretic difference).
|
void | faudes::LanguageConcatenateNonDet (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language concatenation, nondeterministic version.
|
void | faudes::LanguageConcatenate (const vGenerator &rGen1, const vGenerator &rGen2, vGenerator &rResGen) |
| Language concatenation, deterministic version.
|
void | faudes::FullLanguage (const EventSet &rAlphabet, vGenerator &rResGen) |
| Full Language, L(G)=Lm(G)=Sigma*.
|
void | faudes::AlphabetLanguage (const EventSet &rAlphabet, vGenerator &rResGen) |
| Alphabet Language, L(G)=Lm(G)=Sigma.
|
void | faudes::EmptyStringLanguage (const EventSet &rAlphabet, vGenerator &rResGen) |
| Empty string language, L(G)=Lm(G)={epsilon}.
|
void | faudes::EmptyLanguage (const EventSet &rAlphabet, vGenerator &rResGen) |
| Empty language Lm(G)={}.
|
bool | faudes::IsEmptyLanguage (const vGenerator &rGen) |
| Test for Empty language Lm(G)=={}.
|
bool | faudes::LanguageInclusion (const vGenerator &rGen1, const vGenerator &rGen2) |
| Test language inclusion, Lm1<=Lm2.
|
bool | faudes::LanguageEquality (const vGenerator &rGen1, const vGenerator &rGen2) |
| Language equality, Lm1==Lm2.
|
void | faudes::KleeneClosure (vGenerator &rGen) |
| Kleene Closure.
|
void | faudes::KleeneClosureNonDet (vGenerator &rGen) |
| Kleene Closure, nondeterministic version.
|
void | faudes::PrefixClosure (vGenerator &rGen) |
| Prefix Closure.
|
bool | faudes::IsPrefixClosed (const vGenerator &rGen) |
| Test for prefix closed marked language.
|
bool | faudes::IsNonblocking (const vGenerator &rGen) |
| Test for nonblocking generator.
|
bool | faudes::IsNonblocking (const vGenerator &rGen1, const vGenerator &rGen2) |
| Test for nonblocking marked languages.
|
void | faudes::SelfLoop (vGenerator &rGen, const EventSet &rAlphabet) |
| Self-loop all states.
|
void | faudes::SelfLoopMarkedStates (vGenerator &rGen, const EventSet &rAlphabet) |
| Self-loop all marked states.
|
void | faudes::SelfLoop (vGenerator &rGen, const EventSet &rAlphabet, const StateSet &rStates) |
| Self-loop specified states.
|
Operations on regular languages.
See [Cassandras and Lafortune. Introduction to Discrete Event Systems] for an introduction to regular language operations. Operations are always performed on language(s) marked by the passed generator(s), resulting in the language(s) marked by the resulting generator(s). Only if mentioned extra, the same is done for the involved generated (prefix-closed) languages.