-
## *Repository Creation Request*
Use this to get your experiment repository created or updated on GitHub under Virtual Labs organization.
1. #### Coordinating Institute: IIIT Hyderabad
2. #### …
-
## Issue will be closed if:
1. You mention more than one algorithm. Create a separate issue for each once the current one is completed.
2. You propose an algorithm that is already present or has b…
-
Tracking issue for:
- [ ] https://github.com/shgysk8zer0/node-http/security/code-scanning/1
> Some regular expressions take a long time to match certain input strings to the point where the ti…
-
For definition see e.g. https://en.wikipedia.org/wiki/Semi-deterministic_B%C3%BCchi_automaton
-
Hello,
In the paper [Homomorphic Encryption for Finite Automata](https://eprint.iacr.org/2019/176), an automaton with n states over some alphabet, let's say {a, b}, is represented by nxn transition…
-
Hello. Just found biscuit by watching https://docs.rs/releases and decided to review it as you use a few things I'm independently interested in: Ristretto, Macaroons, and Datalog.
**Edit**: I manag…
-
some docs on how to run tregex are here: https://github.com/oracle/graal/blob/master/regex/README.md
probably graalvm enterprise (aka oracle graalvm) will run faster than graalvm ce (community edit…
tarsa updated
4 months ago
-
The current implementation of the `order` function in the markuplint repository uses a backtracking approach which can be inefficient. To optimize this, we propose using a Non-deterministic Finite Aut…
-
Right now, Adiar only supports diagrams, where the terminals (leaves) have boolean values. Of course, one can already use this to express non-boolean values by having *b* BDDs to represent each of the…
-
For my construction I need to output an ω-automaton with ε-transitions and I want to use the HOA format. Unfortunately the specification does not mention ε-transitions explicitly…