Finite Automata Reduction: Difference between revisions

From BusyBeaverWiki
Jump to navigation Jump to search
(→‎History: Mentioned application on BB(5) holdouts)
(Bolded names)
 
Line 1: Line 1:
{{Stub}}
{{Stub}}
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 developes 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>

Latest revision as of 09:14, 4 September 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] On the 9th of April, Finite Automata Reduction is applied on the remaining BB(5) holdouts.[5]

See also

References