-
I just found a `regex` (obviously) that verify if a roman number is valid. Must we move to it? I don't think so, but I think we can implement another automaton, using an `regex` and speed up parsing.
…
-
fda
-
213cy updated
7 years ago
-
For each formalized proof within the embedded DSL, we should include the syntactic proofs as they appear internal to the type theory.
We can either include these as comments; or, perhaps preferabl…
-
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
-
#include
#include
#include
const int final_state=1;
void main()
{
int trans_table[4][2]={{1,2},{1,3},{2,2},{1,3}};
char input_string[20],curr_input,i,l;
int present_state,next_state,valid…
-
-
![Screenshot (40)](https://user-images.githubusercontent.com/112693798/191445760-aa3d762e-bb79-4efe-8402-d5d10ecdd3ab.png)
-
Is there a way to compare two minimized DFAs for equality?
What I really want to do is compare two LTLf terms. I'm hoping to parse them with `logaut`, minimize them, and check for DFA equality.
-
![WhatsApp Image 2022-09-20 at 10 37 05 (1)](https://user-images.githubusercontent.com/113502503/191172307-cad8d32c-f362-48b8-ad24-85db44034ae4.jpeg)