Finite Automata Reduction: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(Began adding a history section)
(Expanded history section (migrated from Cosearch))
Line 2: Line 2:
Finite Automata Reduction (short FAR) is a [[decider]].
Finite Automata Reduction (short FAR) is a [[decider]].
==History==
==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>
* 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 developes an SAT-based FAR implementation.<ref>https://github.com/colette-b/bbchallenge</ref>
* In January 2023, Finite Automata Reduction is reproduced by Tony Guilfoyle.<ref>https://github.com/TonyGuil/bbchallenge/tree/main/FAR</ref>
* In April 2023, the decider is added to the deciders write-up, becoming section 6. Later in April, it is also reproduced by Tristan Stérin.<ref>https://github.com/bbchallenge/bbchallenge-deciders/tree/main/decider-finite-automata-reduction-reproduction</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==
==References==
[[Category:Deciders]]
[[Category:Deciders]]

Revision as of 12:45, 30 August 2025

Finite Automata Reduction (short FAR) is a decider.

History

  • In October 2022, Finite Automata Reduction is first introduced by Justin Blanchard,[1] later in October, Konrad Deka developes an SAT-based FAR implementation.[2]
  • In January 2023, Finite Automata Reduction is reproduced by Tony Guilfoyle.[3]
  • In April 2023, the decider is added to the deciders write-up, becoming section 6. Later in April, it is also reproduced by Tristan Stérin.[4]

See also

Section 6 of bbchallenge's deciders write-up.

References