lernen 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: c925ae55bb57b20dc2ef637e751882ec493d565b7f0b7a8348c858593ef0d5f4
+  data.tar.gz: dbfae4d012e582aeb909460eea27c30945a62e6586cd8ae7f9be48ac2c6dac6c
+SHA512:
+  metadata.gz: c0621a919ee2cebdc932f9aec31aac52ca7cfc528cd8f8f24ff4519e2d39769c4a6c2c5f9eeecad1394339afbe1625a89fb3acb418aa02e452eef2b78eb2a111
+  data.tar.gz: e88d2feb2c44e766e348c62c05ea15cc5eddcb816077e33db40071957047f31b7eccfeb2f9d8b1679c1907f6a57e116042dac009180b5cef2a4453da1c05f7d1

data/.editorconfig

@@ -0,0 +1,8 @@
+root = true
+
+[*]
+end_of_line = lf
+insert_final_newline = true
+charset = utf-8
+indent_style = space
+indent_size = 2

data/.rubocop.yml

@@ -0,0 +1,34 @@
+inherit_gem:
+  syntax_tree: config/rubocop.yml
+
+require:
+  - rubocop-minitest
+  - rubocop-rake
+
+AllCops:
+  TargetRubyVersion: 3.1
+  NewCops: enable
+
+Metrics/AbcSize:
+  Enabled: false
+
+Metrics/BlockLength:
+  Enabled: false
+
+Metrics/ClassLength:
+  Enabled: false
+
+Metrics/CyclomaticComplexity:
+  Enabled: false
+
+Metrics/MethodLength:
+  Enabled: false
+
+Metrics/ModuleLength:
+  Enabled: false
+
+Metrics/ParameterLists:
+  Enabled: false
+
+Metrics/PerceivedComplexity:
+  Enabled: false

data/.yardopts

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

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,84 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our community a harassment-free experience for everyone, regardless of age, body size, visible or invisible disability, ethnicity, sex characteristics, gender identity and expression, level of experience, education, socio-economic status, nationality, personal appearance, race, religion, or sexual identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming, diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our community include:
+
+* Demonstrating empathy and kindness toward other people
+* Being respectful of differing opinions, viewpoints, and experiences
+* Giving and gracefully accepting constructive feedback
+* Accepting responsibility and apologizing to those affected by our mistakes, and learning from the experience
+* Focusing on what is best not just for us as individuals, but for the overall community
+
+Examples of unacceptable behavior include:
+
+* The use of sexualized language or imagery, and sexual attention or
+  advances of any kind
+* Trolling, insulting or derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or email
+  address, without their explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of acceptable behavior and will take appropriate and fair corrective action in response to any behavior that they deem inappropriate, threatening, offensive, or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject comments, commits, code, wiki edits, issues, and other contributions that are not aligned to this Code of Conduct, and will communicate reasons for moderation decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when an individual is officially representing the community in public spaces. Examples of representing our community include using an official e-mail address, posting via an official social media account, or acting as an appointed representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be reported to the community leaders responsible for enforcement at make.just.on@gmail.com. All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing clarity around the nature of the violation and an explanation of why the behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of actions.
+
+**Consequence**: A warning with consequences for continued behavior. No interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, for a specified period of time. This includes avoiding interactions in community spaces as well as external channels like social media. Violating these terms may lead to a temporary or permanent ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public communication with the community for a specified period of time. No public or private interaction with the people involved, including unsolicited interaction with those enforcing the Code of Conduct, is allowed during this period. Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community standards, including sustained inappropriate behavior,  harassment of an individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 2.0,
+available at https://www.contributor-covenant.org/version/2/0/code_of_conduct.html.
+
+Community Impact Guidelines were inspired by [Mozilla's code of conduct enforcement ladder](https://github.com/mozilla/diversity).
+
+[homepage]: https://www.contributor-covenant.org
+
+For answers to common questions about this code of conduct, see the FAQ at
+https://www.contributor-covenant.org/faq. Translations are available at https://www.contributor-covenant.org/translations.

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2024 TSUYUSATO Kitsune
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,45 @@
+# Lernen
+
+> a simple automata learning library.
+
+## Usage
+
+```ruby
+require "lernen"
+
+alphabet = %w[0 1]
+sul = Lernen::SUL.from_block { |inputs| inputs.count { _1 == "1" } % 4 == 3 }
+oracle = Lernen::BreadthFirstExplorationOracle.new(alphabet, sul)
+
+dfa = Lernen::LStar.learn(alphabet, sul, oracle, automaton_type: :dfa)
+# => Lernen::DFA.new(
+#      0,
+#      Set[3],
+#      {
+#        [0, "0"] => 0,
+#        [0, "1"] => 1,
+#        [1, "0"] => 1,
+#        [1, "1"] => 2,
+#        [2, "0"] => 2,
+#        [2, "1"] => 3,
+#        [3, "0"] => 3,
+#        [3, "1"] => 0
+#      }
+#    )
+```
+
+## Algorithms
+
+Learnen supports these automata learning algorithms.
+
+| Algorithm        | Supported `automaton_type` |
+|:----------------:|:--------------------------:|
+| `LStar`          | `:dfa`, `:moore`, `:mealy` |
+| `KearnsVazirani` | `:dfa`, `:moore`, `:mealy` |
+| `LSharp`         | `:dfa`, `:moore`, `:mealy` |
+
+## License
+
+[MIT](https://opensource.org/license/MIT)
+
+2024 (C) Hiroya Fujinami

data/Rakefile

@@ -0,0 +1,29 @@
+# frozen_string_literal: true
+
+require "bundler/gem_tasks"
+require "minitest/test_task"
+require "yard"
+require "rubocop/rake_task"
+require "syntax_tree/rake_tasks"
+
+Minitest::TestTask.create
+
+YARD::Rake::YardocTask.new do |t|
+  t.files = ["lib/**/*.rb"]
+  t.stats_options = ["--list-undoc"]
+end
+
+RuboCop::RakeTask.new { |t| t.options = %w[--fail-level W] }
+
+[SyntaxTree::Rake::WriteTask, SyntaxTree::Rake::CheckTask].each do |task|
+  task.new do |t|
+    t.source_files =
+      FileList[
+        %w[Gemfile Rakefile *.gemspec bin/**/{console,rake} lib/**/*.rb test/**/*.rb example/**/*.rb tool/**/*.rb]
+      ]
+    t.print_width = 120
+  end
+end
+
+task format: %w[rubocop:autocorrect_all stree:write]
+task lint: %w[rubocop stree:check]

data/lib/lernen/automaton.rb

@@ -0,0 +1,101 @@
+# frozen_string_literal: true
+
+module Lernen
+  # Automaton is an abstract class for automata.
+  #
+  # Note that this class is *abstract*. You should implement the following method:
+  #
+  # - `#step(state, input)`
+  class Automaton
+    # Computes a transition for the given `input` from the current `state`.
+    #
+    # This is *abstract*.
+    def step(_state, _input)
+      raise TypeError, "abstract method: `step`"
+    end
+
+    # Runs this automaton with the given input string and returns an output sequence
+    # and a state after running.
+    def run(inputs)
+      state = @initial_state
+      outputs = []
+      inputs.each do |input|
+        output, state = step(state, input)
+        outputs << output
+      end
+      [outputs, state]
+    end
+  end
+
+  # DFA is a deterministic finite-state automaton.
+  class DFA < Automaton
+    def initialize(initial_state, accept_states, transitions)
+      super()
+
+      @initial_state = initial_state
+      @accept_states = accept_states
+      @transitions = transitions
+    end
+
+    attr_reader :initial_state, :accept_states, :transitions
+
+    # Computes a transition for the given `input` from the current `state`.
+    def step(state, input)
+      next_state = @transitions[[state, input]]
+      output = @accept_states.include?(next_state)
+      [output, next_state]
+    end
+
+    # Checks equality.
+    def ==(other)
+      initial_state == other.initial_state && accept_states == other.accept_states && transitions == other.transitions
+    end
+  end
+
+  # Moore is a deterministic Moore machine.
+  class Moore < Automaton
+    def initialize(initial_state, outputs, transitions)
+      super()
+
+      @initial_state = initial_state
+      @outputs = outputs
+      @transitions = transitions
+    end
+
+    attr_reader :initial_state, :outputs, :transitions
+
+    # Computes a transition for the given `input` from the current `state`.
+    def step(state, input)
+      next_state = @transitions[[state, input]]
+      output = @outputs[next_state]
+      [output, next_state]
+    end
+
+    # Checks equality.
+    def ==(other)
+      initial_state == other.initial_state && outputs == other.outputs && transitions == other.transitions
+    end
+  end
+
+  # Mealy is a deterministic Mealy machine.
+  class Mealy < Automaton
+    def initialize(initial_state, transitions)
+      super()
+
+      @initial_state = initial_state
+      @transitions = transitions
+    end
+
+    attr_reader :initial_state, :transitions
+
+    # Computes a transition for the given `input` from the current `state`.
+    def step(state, input)
+      @transitions[[state, input]]
+    end
+
+    # Checks equality.
+    def ==(other)
+      initial_state == other.initial_state && transitions == other.transitions
+    end
+  end
+end

data/lib/lernen/cex_processor.rb

@@ -0,0 +1,61 @@
+# 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

@@ -0,0 +1,199 @@
+# 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