-
www
dfasdfasdf sdf
-
In your documentation, it is stated that when the Hurst exponent h(2) > 0.5, it indicates long-range autocorrelation, while h(2) < 0.5 indicates short-range autocorrelation. However, this is incorrect…
-
Is there a C API that can be called directly to generate the data structures for the DFA? For example, take some regular expressions and generate a state transition diagram of a state machine
-
-
Gibt es ein bevorzugtes Kürzel für die Systematik (z.B. HFS)? Für die [Personen-Kategorien nach Destatis](https://bartoc.org/en/node/18920) verwenden wir DFÄ.
-
This would obviously be better if jpcre2 could encapsulate pcre2_dfa_match()
-
asdf
-
It would be very useful for lexing, and I imagine other tasks if it was possible to combine two DFAs.
The combination operations result would be a new DFA which retains the mappings in the first DFA …
-
Current implementation of `executeDFA` has type:
``` haskell
executeDFA :: DFA -> [Alpha] -> Maybe [State]
```
The function returns a list of states in case there is a valid path for the word given …
-
This is a very long term suggestion; it is not urgent and very much a wish list item. This suggestion is currently pretty fuzzy and I haven't thought through all the implications, but I wanted to get …