-
User std::cerr to output error messages.
https://github.com/kamosevoyan/Finite-Deterministic-Automaton/blob/4839e51fc60116e7f2374a60c3a186bead9e6b6f/src/FDA.cpp#L47
-
The default test file, specified in `PackageInfo.g`, is `tst.g` which is a GAP input file. I run it, and it _seems_ to work:
```
gap> TestPackage("predicata");
Reading tst.g
Predicaton: determin…
-
Collaboration with @msbranicky
* Thank you to @lynn for her thoughtful update to the DFA description https://github.com/code-golf/code-golf/pull/1013/files. We are using this language here too.
* An…
-
The construction of the complement of an automaton (automat.fsm/complement) is wrong, as it appears by inspecting the svg of the complement of a, or of the complement of a*. Currently the function bui…
-
Ao marcar estados como finais ou iniciais, os autômatos não salvam automaticamente as alterações.
-
Lambda and Delta functions would better to be separated.
Also makes sense to have std::pair as the map key, instead of combining two strings into one.
https://github.com/kamosevoyan/Finite-Deter…
-
Would it be permissable to use the code of the fsm in my bachelor's thesis? I aim to recognize handdraw finite automatons and then convert them to some object notation but it would also be great to di…
-
I create tools to manipulate finite automaton : minimize, determinize, etc...
I create tools to manipulate beta-adic monoids (with eventually a subshift of finite type).
And you can compute finite a…
-
Define the type of finite automata, and then characterize its equality using SIP. This should give one of the several notions of automata equivalence known from the literature. (The "right" one?) Like…
-
**This is a(n):**
- [x] New algorithm
- [ ] Update to an existing algorithm
- [ ] Error
- [ ] Proposal to the Repository
**Details:**
https://en.wikipedia.org/wiki/Deterministic_fi…