Finite Automata Reduction: Difference between revisions
Jump to navigation
Jump to search
(Added a short introduction) |
(Began adding a history section) |
||
| Line 1: | Line 1: | ||
{{Stub}} | {{Stub}} | ||
Finite Automata Reduction (short FAR) is a [[decider]]. | Finite Automata Reduction (short FAR) is a [[decider]]. | ||
==History== | |||
* In October 2022, Finite Automata Reduction is first introduced by Justin Blanchard,<ref>https://github.com/UncombedCoconut/bbchallenge-deciders/tree/finite-automata-reduction/decider-finite-automata-reduction</ref> later in October, Konrad Deka developed an SAT-based FAR implementation.<ref>https://github.com/colette-b/bbchallenge</ref> | |||
==See also== | ==See also== | ||
[https://github.com/bbchallenge/bbchallenge-proofs/blob/build-latex-pdf/deciders/correctness-deciders.pdf Section 6] of bbchallenge's deciders write-up. | [https://github.com/bbchallenge/bbchallenge-proofs/blob/build-latex-pdf/deciders/correctness-deciders.pdf Section 6] of bbchallenge's deciders write-up. | ||
==References== | |||
[[Category:Deciders]] | [[Category:Deciders]] | ||