|
|
||||||
|
|
Misc Functions on GeneratorsEmptyLanguageSet generator to mark empty language. Detailed description:Returns a generator G with the specified alphabet Sigma, no states and no transitions; i.e., we have Lm(G) = L(G) = 0. Parameter Conditions:The empty language generator is deterministic. IsEmptyLanguageTest Generator G for empty marked language Lm(G). Parameter Conditions:The argument may be non-deterministic. AutomatonConvert generator to formal automaton. Detailed description:Converts the given generator G to a formal automaton that generates the same marked language Lm(G) while accepting any input string, i.e. L(G) = Sigma*. This is achieved by introducing a dump state to represent Sigma*-Closure(Lm(G)). Example:
Parameter Conditions:The provided generator is assumed to be deterministic. The resulting generator is guaranteed to be deterministic. IsClosedTests a language for being prefix-closed. Detailed description:
A language L is prefix-closed
if for each string s ∈ L all prefixes r ≤ s
are also element of L:
Example:
The language Lm(G) marked by the above generator is not prefix-closed, since the states 1, 2 and 4 are accessible and co-accessible but not marked. For example, the string ac ∉ Lm(G) is a prefix of acbb ∈ Lm(G). PrefixClosureCompute prefix closure for given language. Signature:PrefixClosure(+InOut+ Generator GArg) Detailed description:
For any language L there exists a smallest prefix-closed
superset, the so-called prefix-closure of L:
This function computes a realisation of the prefix-closure of Lm(GArg) by first erasing all states that are not co-accessible and then marking the remaining states. Example:
libFAUDES 2.33h --- 2025.06.18 --- with "omegaaut-synthesis-observer-observability-diagnosis-hiosys-iosystem-multitasking-coordinationcontrol-timed-simulator-iodevice-priorities-luabindings-hybrid-example-pybindings" |