lernen 0.1.0 → 0.3.0

data/sig-test/generated/test/lernen/automaton/dfa_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/dfa_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class DFATest < Minitest::Test
+      # : () -> Lernen::Automaton::DFA[String]
+      def self.mod4_dfa: () -> Lernen::Automaton::DFA[String]
+
+      # : () -> void
+      def test_run: () -> void
+
+      # : () -> void
+      def test_to_mermaid: () -> void
+
+      # : () -> void
+      def test_to_dot: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/automaton/mealy_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/mealy_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class MealyTest < Minitest::Test
+      # : () -> Lernen::Automaton::Mealy[String, Integer]
+      def self.mod4_mealy: () -> Lernen::Automaton::Mealy[String, Integer]
+
+      # : () -> void
+      def test_run: () -> void
+
+      # : () -> void
+      def test_to_mermaid: () -> void
+
+      # : () -> void
+      def test_to_dot: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/automaton/moore_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/moore_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class MooreTest < Minitest::Test
+      # : () -> Lernen::Automaton::Moore[String, Integer]
+      def self.mod4_moore: () -> Lernen::Automaton::Moore[String, Integer]
+
+      # : () -> void
+      def test_run: () -> void
+
+      # : () -> void
+      def test_to_mermaid: () -> void
+
+      # : () -> void
+      def test_to_dot: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/automaton/proc_util_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/proc_util_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class ProcUtilTest < Minitest::Test
+      # : () -> void
+      def test_expand: () -> void
+
+      # : () -> void
+      def test_project: () -> void
+
+      # : () -> void
+      def test_find_call_index: () -> void
+
+      # : () -> void
+      def test_find_return_index: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/automaton/spa_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/spa_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class SPATest < Minitest::Test
+      # : () -> Lernen::Automaton::SPA[String, Symbol, Symbol]
+      def self.palindrome_spa: () -> Lernen::Automaton::SPA[String, Symbol, Symbol]
+
+      # : () -> void
+      def test_run: () -> void
+
+      # : () -> void
+      def test_to_mermaid: () -> void
+
+      # : () -> void
+      def test_to_dot: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/automaton/vpa_test.rbs

@@ -0,0 +1,19 @@
+# Generated from test/lernen/automaton/vpa_test.rb with RBS::Inline
+
+module Lernen
+  module Automaton
+    class VPATest < Minitest::Test
+      # : () -> Lernen::Automaton::VPA[String, String, String]
+      def self.dyck_vpa: () -> Lernen::Automaton::VPA[String, String, String]
+
+      # : () -> void
+      def test_run: () -> void
+
+      # : () -> void
+      def test_to_mermaid: () -> void
+
+      # : () -> void
+      def test_to_dot: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/equiv/exhaustive_search_oracle_test.rbs

@@ -0,0 +1,10 @@
+# Generated from test/lernen/equiv/exhaustive_search_oracle_test.rb with RBS::Inline
+
+module Lernen
+  module Equiv
+    class ExhaustiveSearchOracleTest < Minitest::Test
+      # : () -> void
+      def test_find_cex_and_stats: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/equiv/random_walk_oracle_test.rbs

@@ -0,0 +1,10 @@
+# Generated from test/lernen/equiv/random_walk_oracle_test.rb with RBS::Inline
+
+module Lernen
+  module Equiv
+    class RandomWalkOracleTest < Minitest::Test
+      # : () -> void
+      def test_find_cex: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/equiv/random_word_oracle_test.rbs

@@ -0,0 +1,10 @@
+# Generated from test/lernen/equiv/random_word_oracle_test.rb with RBS::Inline
+
+module Lernen
+  module Equiv
+    class RandomWordOracleTest < Minitest::Test
+      # : () -> void
+      def test_find_cex: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/system/block_sul_test.rbs

@@ -0,0 +1,16 @@
+# Generated from test/lernen/system/block_sul_test.rb with RBS::Inline
+
+module Lernen
+  module System
+    class BlockSULTest < Minitest::Test
+      # : () -> void
+      def test_step: () -> void
+
+      # : () -> void
+      def test_query_and_stats: () -> void
+
+      # : () -> void
+      def test_query_empty: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/system/moore_like_simulator_test.rbs

@@ -0,0 +1,16 @@
+# Generated from test/lernen/system/moore_like_simulator_test.rb with RBS::Inline
+
+module Lernen
+  module System
+    class MooreLikeSimulatorTest < Minitest::Test
+      # : () -> void
+      def test_step: () -> void
+
+      # : () -> void
+      def test_query_and_stats: () -> void
+
+      # : () -> void
+      def test_query_empty: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/system/transition_system_simulator_test.rbs

@@ -0,0 +1,13 @@
+# Generated from test/lernen/system/transition_system_simulator_test.rb with RBS::Inline
+
+module Lernen
+  module System
+    class TransitionSystemSimulatorTest < Minitest::Test
+      # : () -> void
+      def test_step: () -> void
+
+      # : () -> void
+      def test_query_and_stats: () -> void
+    end
+  end
+end

data/sig-test/generated/test/lernen/system_test.rbs

@@ -0,0 +1,11 @@
+# Generated from test/lernen/system_test.rb with RBS::Inline
+
+module Lernen
+  class SystemTest < Minitest::Test
+    # : () -> void
+    def test_from_block: () -> void
+
+    # : () -> void
+    def test_from_automaton: () -> void
+  end
+end

data/sig-test/generated/test/lernen_test.rbs

@@ -0,0 +1,13 @@
+# Generated from test/lernen_test.rb with RBS::Inline
+
+class LernenTest < Minitest::Test
+  N: ::Integer
+
+  ORACLE: :random_word
+
+  ORACLE_PARAMS: Hash[Symbol, Integer]
+
+  VPA_ORACLE_PARAMS: Hash[Symbol, Integer]
+
+  TEST_CASES: Array[[ Lernen::algorithm_name, Hash[Symbol, Symbol] ]]
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: lernen
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.3.0
 platform: ruby
 authors:
 - TSUYUSATO Kitsune
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2024-08-22 00:00:00.000000000 Z
+date: 2024-10-01 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: set
@@ -33,20 +33,140 @@ extra_rdoc_files: []
 files:
 - ".editorconfig"
 - ".rubocop.yml"
-- ".yardopts"
 - CODE_OF_CONDUCT.md
 - LICENSE.txt
 - README.md
 - Rakefile
+- Steepfile
+- examples/ripper_prism.rb
+- examples/uri_parse_regexp.rb
 - lib/lernen.rb
+- lib/lernen/algorithm.rb
+- lib/lernen/algorithm/cex_processor.rb
+- lib/lernen/algorithm/cex_processor/acex.rb
+- lib/lernen/algorithm/cex_processor/prefix_transformer_acex.rb
+- lib/lernen/algorithm/kearns_vazirani.rb
+- lib/lernen/algorithm/kearns_vazirani/discrimination_tree.rb
+- lib/lernen/algorithm/kearns_vazirani/kearns_vazirani_learner.rb
+- lib/lernen/algorithm/kearns_vazirani_vpa.rb
+- lib/lernen/algorithm/kearns_vazirani_vpa/discrimination_tree_vpa.rb
+- lib/lernen/algorithm/kearns_vazirani_vpa/kearns_vazirani_vpa_learner.rb
+- lib/lernen/algorithm/learner.rb
+- lib/lernen/algorithm/lsharp.rb
+- lib/lernen/algorithm/lsharp/lsharp_learner.rb
+- lib/lernen/algorithm/lsharp/observation_tree.rb
+- lib/lernen/algorithm/lstar.rb
+- lib/lernen/algorithm/lstar/lstar_learner.rb
+- lib/lernen/algorithm/lstar/observation_table.rb
+- lib/lernen/algorithm/procedural.rb
+- lib/lernen/algorithm/procedural/atr_manager.rb
+- lib/lernen/algorithm/procedural/procedural_learner.rb
+- lib/lernen/algorithm/procedural/procedural_sul.rb
+- lib/lernen/algorithm/procedural/return_indices_acex.rb
 - lib/lernen/automaton.rb
-- lib/lernen/cex_processor.rb
-- lib/lernen/kearns_vazirani.rb
-- lib/lernen/lsharp.rb
-- lib/lernen/lstar.rb
-- lib/lernen/oracle.rb
-- lib/lernen/sul.rb
+- lib/lernen/automaton/dfa.rb
+- lib/lernen/automaton/mealy.rb
+- lib/lernen/automaton/moore.rb
+- lib/lernen/automaton/moore_like.rb
+- lib/lernen/automaton/proc_util.rb
+- lib/lernen/automaton/spa.rb
+- lib/lernen/automaton/transition_system.rb
+- lib/lernen/automaton/vpa.rb
+- lib/lernen/equiv.rb
+- lib/lernen/equiv/combined_oracle.rb
+- lib/lernen/equiv/exhaustive_search_oracle.rb
+- lib/lernen/equiv/moore_like_simulator_oracle.rb
+- lib/lernen/equiv/oracle.rb
+- lib/lernen/equiv/random_walk_oracle.rb
+- lib/lernen/equiv/random_well_matched_word_oracle.rb
+- lib/lernen/equiv/random_word_oracle.rb
+- lib/lernen/equiv/spa_simulator_oracle.rb
+- lib/lernen/equiv/test_words_oracle.rb
+- lib/lernen/equiv/transition_system_simulator_oracle.rb
+- lib/lernen/equiv/vpa_simulator_oracle.rb
+- lib/lernen/graph.rb
+- lib/lernen/system.rb
+- lib/lernen/system/block_sul.rb
+- lib/lernen/system/moore_like_simulator.rb
+- lib/lernen/system/moore_like_sul.rb
+- lib/lernen/system/sul.rb
+- lib/lernen/system/transition_system_simulator.rb
 - lib/lernen/version.rb
+- rbs_collection.lock.yaml
+- rbs_collection.yaml
+- renovate.json
+- sig-test/generated/test/example_test.rbs
+- sig-test/generated/test/lernen/algorithm/kearns_vazirani_test.rbs
+- sig-test/generated/test/lernen/algorithm/kearns_vazirani_vpa_test.rbs
+- sig-test/generated/test/lernen/algorithm/lsharp_test.rbs
+- sig-test/generated/test/lernen/algorithm/lstar_test.rbs
+- sig-test/generated/test/lernen/algorithm/procedural_test.rbs
+- sig-test/generated/test/lernen/automaton/dfa_test.rbs
+- sig-test/generated/test/lernen/automaton/mealy_test.rbs
+- sig-test/generated/test/lernen/automaton/moore_test.rbs
+- sig-test/generated/test/lernen/automaton/proc_util_test.rbs
+- sig-test/generated/test/lernen/automaton/spa_test.rbs
+- sig-test/generated/test/lernen/automaton/vpa_test.rbs
+- sig-test/generated/test/lernen/equiv/exhaustive_search_oracle_test.rbs
+- sig-test/generated/test/lernen/equiv/random_walk_oracle_test.rbs
+- sig-test/generated/test/lernen/equiv/random_word_oracle_test.rbs
+- sig-test/generated/test/lernen/system/block_sul_test.rbs
+- sig-test/generated/test/lernen/system/moore_like_simulator_test.rbs
+- sig-test/generated/test/lernen/system/transition_system_simulator_test.rbs
+- sig-test/generated/test/lernen/system_test.rbs
+- sig-test/generated/test/lernen_test.rbs
+- sig/generated/lernen.rbs
+- sig/generated/lernen/algorithm.rbs
+- sig/generated/lernen/algorithm/cex_processor.rbs
+- sig/generated/lernen/algorithm/cex_processor/acex.rbs
+- sig/generated/lernen/algorithm/cex_processor/prefix_transformer_acex.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani/discrimination_tree.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani/kearns_vazirani_learner.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani_vpa.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani_vpa/discrimination_tree_vpa.rbs
+- sig/generated/lernen/algorithm/kearns_vazirani_vpa/kearns_vazirani_vpa_learner.rbs
+- sig/generated/lernen/algorithm/learner.rbs
+- sig/generated/lernen/algorithm/lsharp.rbs
+- sig/generated/lernen/algorithm/lsharp/lsharp_learner.rbs
+- sig/generated/lernen/algorithm/lsharp/observation_tree.rbs
+- sig/generated/lernen/algorithm/lstar.rbs
+- sig/generated/lernen/algorithm/lstar/lstar_learner.rbs
+- sig/generated/lernen/algorithm/lstar/observation_table.rbs
+- sig/generated/lernen/algorithm/procedural.rbs
+- sig/generated/lernen/algorithm/procedural/atr_manager.rbs
+- sig/generated/lernen/algorithm/procedural/procedural_learner.rbs
+- sig/generated/lernen/algorithm/procedural/procedural_sul.rbs
+- sig/generated/lernen/algorithm/procedural/return_indices_acex.rbs
+- sig/generated/lernen/automaton.rbs
+- sig/generated/lernen/automaton/dfa.rbs
+- sig/generated/lernen/automaton/mealy.rbs
+- sig/generated/lernen/automaton/moore.rbs
+- sig/generated/lernen/automaton/moore_like.rbs
+- sig/generated/lernen/automaton/proc_util.rbs
+- sig/generated/lernen/automaton/spa.rbs
+- sig/generated/lernen/automaton/transition_system.rbs
+- sig/generated/lernen/automaton/vpa.rbs
+- sig/generated/lernen/equiv.rbs
+- sig/generated/lernen/equiv/combined_oracle.rbs
+- sig/generated/lernen/equiv/exhaustive_search_oracle.rbs
+- sig/generated/lernen/equiv/moore_like_simulator_oracle.rbs
+- sig/generated/lernen/equiv/oracle.rbs
+- sig/generated/lernen/equiv/random_walk_oracle.rbs
+- sig/generated/lernen/equiv/random_well_matched_word_oracle.rbs
+- sig/generated/lernen/equiv/random_word_oracle.rbs
+- sig/generated/lernen/equiv/spa_simulator_oracle.rbs
+- sig/generated/lernen/equiv/test_words_oracle.rbs
+- sig/generated/lernen/equiv/transition_system_simulator_oracle.rbs
+- sig/generated/lernen/equiv/vpa_simulator_oracle.rbs
+- sig/generated/lernen/graph.rbs
+- sig/generated/lernen/system.rbs
+- sig/generated/lernen/system/block_sul.rbs
+- sig/generated/lernen/system/moore_like_simulator.rbs
+- sig/generated/lernen/system/moore_like_sul.rbs
+- sig/generated/lernen/system/sul.rbs
+- sig/generated/lernen/system/transition_system_simulator.rbs
+- sig/generated/lernen/version.rbs
 homepage: https://github.com/makenowjust/lernen
 licenses:
 - MIT
@@ -69,8 +189,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.6.0.dev
+rubygems_version: 3.5.11
 signing_key:
 specification_version: 4
-summary: a simple automata leraning library
+summary: an automata leraning library
 test_files: []

data/.yardopts

@@ -1,3 +0,0 @@
---protected
---no-private
---markup markdown

data/lib/lernen/cex_processor.rb

@@ -1,61 +0,0 @@
-# frozen_string_literal: true
-
-module Lernen
-  # CexProcessor is a collection of implementations of couterexample processing procesudres.
-  module CexProcessor
-    # Processes a given `cex`. It returns a new prefix and suffix to advance a learning.
-    def self.process(sul, hypothesis, cex, state_to_prefix, cex_processing: :binary)
-      case cex_processing
-      in :linear
-        process_linear(sul, hypothesis, cex, state_to_prefix)
-      in :binary
-        process_binary(sul, hypothesis, cex, state_to_prefix)
-      end
-    end
-
-    # Processes a given `cex` by linear search.
-    def self.process_linear(sul, hypothesis, cex, state_to_prefix)
-      expected_output = sul.query(cex).last
-
-      current_state = hypothesis.initial_state
-      cex.each_with_index do |a, i|
-        _, next_state = hypothesis.step(current_state, a)
-
-        prefix = state_to_prefix[next_state]
-        suffix = cex[i + 1...]
-        return state_to_prefix[current_state], a, suffix if expected_output != sul.query(prefix + suffix).last
-
-        current_state = next_state
-      end
-    end
-
-    # Processes a given `cex` by binary search.
-    #
-    # It is known as the Rivest-Schapire (RS) technique.
-    def self.process_binary(sul, hypothesis, cex, state_to_prefix)
-      expected_output = sul.query(cex).last
-
-      low = 0
-      high = cex.size
-
-      while high - low > 1
-        mid = (low + high) / 2
-        prefix = cex[0...mid]
-        suffix = cex[mid...]
-
-        _, prefix_state = hypothesis.run(prefix)
-        if expected_output == sul.query(state_to_prefix[prefix_state] + suffix).last
-          low = mid
-        else
-          high = mid
-        end
-      end
-
-      prefix = cex[0...low]
-      suffix = cex[high...]
-
-      _, prefix_state = hypothesis.run(prefix)
-      [state_to_prefix[prefix_state], cex[low], suffix]
-    end
-  end
-end

data/lib/lernen/kearns_vazirani.rb

@@ -1,199 +0,0 @@
-# frozen_string_literal: true
-
-module Lernen
-  # ClassificationTree is a classification tree implementation.
-  class ClassificationTree
-    Node = Data.define(:suffix, :edges)
-    Leaf = Data.define(:prefix)
-
-    private_constant :Node, :Leaf
-
-    def initialize(alphabet, sul, cex:, automaton_type:, cex_processing:)
-      @alphabet = alphabet
-      @sul = sul
-      @automaton_type = automaton_type
-      @cex_processing = cex_processing
-
-      @paths = {}
-
-      case @automaton_type
-      in :dfa | :moore
-        @root = Node[[], {}]
-
-        empty_out = sul.query_empty
-        @root.edges[empty_out] = Leaf[[]]
-        @paths[[]] = [empty_out]
-
-        cex_out = sul.query(cex).last
-        @root.edges[cex_out] = Leaf[cex]
-        @paths[cex] = [cex_out]
-      in :mealy
-        suffix = [cex.last]
-        @root = Node[suffix, {}]
-
-        suffix_out = sul.query(suffix).last
-        @root.edges[suffix_out] = Leaf[[]]
-        @paths[[]] = [suffix_out]
-
-        cex_out = sul.query(cex).last
-        @root.edges[cex_out] = Leaf[cex]
-        @paths[cex] = [cex_out]
-      end
-    end
-
-    # Returns a prefix classified by `word`.
-    def sift(word)
-      node = @root
-      path = []
-
-      until node.is_a?(Leaf)
-        inputs = word + node.suffix
-        out = @sul.query(inputs).last
-        path << out
-
-        unless node.edges.include?(out)
-          node.edges[out] = Leaf[word]
-          @paths[word] = path
-        end
-
-        node = node.edges[out]
-      end
-
-      node.prefix
-    end
-
-    # Constructs a hypothesis automaton from this classification tree.
-    def to_hypothesis
-      transitions = {}
-
-      queue = []
-      prefix_to_state = {}
-
-      queue << []
-      prefix_to_state[[]] = prefix_to_state.size
-
-      until queue.empty?
-        prefix = queue.shift
-        state = prefix_to_state[prefix]
-        @alphabet.each do |input|
-          word = prefix + [input]
-          next_prefix = sift(word)
-
-          unless prefix_to_state.include?(next_prefix)
-            prefix_to_state[next_prefix] = prefix_to_state.size
-            queue << next_prefix
-          end
-
-          next_state = prefix_to_state[next_prefix]
-          case @automaton_type
-          in :dfa | :moore
-            transitions[[state, input]] = next_state
-          in :mealy
-            output = @sul.query(word).last
-            transitions[[state, input]] = [output, next_state]
-          end
-        end
-      end
-
-      state_to_prefix = prefix_to_state.to_h { |q, i| [i, q] }
-      automaton =
-        case @automaton_type
-        in :dfa
-          accept_states = state_to_prefix.to_a.filter { |(_, q)| @paths[q][0] }.to_set { |(i, _)| i }
-          DFA.new(0, accept_states, transitions)
-        in :moore
-          outputs = state_to_prefix.transform_values { |q| @paths[q][0] }
-          Moore.new(0, outputs, transitions)
-        in :mealy
-          Mealy.new(0, transitions)
-        end
-
-      [automaton, state_to_prefix]
-    end
-
-    # Update this classification tree by the given `cex`.
-    def process_cex(hypothesis, cex, state_to_prefix)
-      old_prefix, new_input, new_suffix =
-        CexProcessor.process(@sul, hypothesis, cex, state_to_prefix, cex_processing: @cex_processing)
-
-      _, old_prefix_state = hypothesis.run(old_prefix)
-      new_prefix = state_to_prefix[old_prefix_state] + [new_input]
-      new_prefix_out = @sul.query(new_prefix + new_suffix).last
-
-      _, old_node_state = hypothesis.run(old_prefix + [new_input])
-      old_node_prefix = state_to_prefix[old_node_state]
-      old_node_out = @sul.query(old_node_prefix + new_suffix).last
-
-      old_node_path = @paths[old_node_prefix]
-      parent = @root
-      old_node = @root.edges[old_node_path.first]
-      old_node_path[1..].each do |out|
-        parent = old_node
-        old_node = old_node.edges[out]
-      end
-
-      new_node = Node[new_suffix, {}]
-      parent.edges[old_node_path.last] = new_node
-
-      new_node.edges[new_prefix_out] = Leaf[new_prefix]
-      @paths[new_prefix] = old_node_path + [new_prefix_out]
-
-      new_node.edges[old_node_out] = Leaf[old_node_prefix]
-      @paths[old_node_prefix] = old_node_path + [old_node_out]
-    end
-  end
-
-  # KearnsVazirani is an implementation of the Kearns-Vazirani automata learning algorithm.
-  module KearnsVazirani
-    # Runs the Kearns-Vazirani algoritghm and returns an inferred automaton.
-    def self.learn(alphabet, sul, oracle, automaton_type:, cex_processing: :binary, max_learning_rounds: nil)
-      hypothesis = construct_first_hypothesis(alphabet, sul, automaton_type)
-      cex = oracle.find_cex(hypothesis)
-      return hypothesis if cex.nil?
-
-      classification_tree = ClassificationTree.new(alphabet, sul, cex:, automaton_type:, cex_processing:)
-      learning_rounds = 0
-
-      loop do
-        break if max_learning_rounds && learning_rounds == max_learning_rounds
-        learning_rounds += 1
-
-        hypothesis, state_to_prefix = classification_tree.to_hypothesis
-        cex = oracle.find_cex(hypothesis)
-        break if cex.nil?
-
-        classification_tree.process_cex(hypothesis, cex, state_to_prefix)
-      end
-
-      hypothesis, = classification_tree.to_hypothesis
-      hypothesis
-    end
-
-    # Constructs the first hypothesis automaton.
-    def self.construct_first_hypothesis(alphabet, sul, automaton_type)
-      transitions = {}
-      alphabet.each do |a|
-        case automaton_type
-        in :dfa | :moore
-          transitions[[0, a]] = 0
-        in :mealy
-          out = sul.query([a]).last
-          transitions[[0, a]] = [out, 0]
-        end
-      end
-
-      case automaton_type
-      in :dfa
-        accept_states = sul.query_empty ? Set[0] : Set.new
-        DFA.new(0, accept_states, transitions)
-      in :moore
-        outputs = { 0 => sul.query_empty }
-        Moore.new(0, outputs, transitions)
-      in :mealy
-        Mealy.new(0, transitions)
-      end
-    end
-
-    private_class_method :construct_first_hypothesis
-  end
-end