automata 0.0.2 → 0.0.3

data/README.md

@@ -2,8 +2,12 @@
 
 A sweet Ruby gem for creating and simulating deterministic/nondeterministic finite automata, push-down automata, and Turing machines.
 
+__Note:__ This gem is still under development. Not all automata have been fully implemented yet.
+
 ## Installation
 
+Requires __Ruby 1.9.3__.
+
 Add this line to your application's Gemfile:
 
     gem 'automata'
@@ -18,7 +22,7 @@ Or install it yourself as:
 
 ## Usage
 
-TODO: Write usage instructions here
+We'll be adding some wiki pages with usage details soon.
 
 ## Contributing
 

data/examples/nfa_sample.yml

@@ -0,0 +1,28 @@
+##
+# Sample NFA build file
+# Accepts: a* + (ab)*
+#
+states:
+  - q1
+  - q2
+  - q3
+  - q4
+alphabet:
+  - a
+  - b
+start: q1
+accept:
+  - q1
+  - q2
+  - q4
+transitions:
+  q1:
+    a:
+      - q2
+      - q3
+  q2:
+    a: q2
+  q3:
+    b: q4
+  q4:
+    a: q3

data/lib/automata/dfa.rb

@@ -28,7 +28,7 @@ module Automata
     # Determines whether the DFA accepts the given string.
     #
     # * *Args*:
-    #   - +string* -> The string to use as input for the DFA.
+    #   - +string+ -> The string to use as input for the DFA.
     #
     # * *Returns*:
     #   Whether or not the DFA accepts the string (boolean).

data/lib/automata/nfa.rb

@@ -0,0 +1,94 @@
+module Automata
+  
+  ##
+  # Deterministic Finite Automata.
+  # 
+  # NFA nodes do not need to have a transition for each
+  # symbol in the alphabet. Empty transitions, denoted by 
+  # the '&' charactar, force a transition to another node.
+  #
+  #--
+  # TODO: Check that each state is connected.
+  #
+  class NFA < StateDiagram
+    
+    #--
+    # TODO: Check if valid NFA.
+    #
+    
+    ##
+    # Determines whether the NFA accepts the given string.
+    #
+    # * *Args*:
+    #   - +string+ -> The string to use as input for the DFA.
+    # * *Returns*:
+    #   Whether or not the DFA accepts the string (boolean).
+    #
+    def accepts?(string)
+      heads = [@start]
+      string.each_char do |symbol|
+        newHeads = []
+        heads.each_with_index do |head, i|
+          #--
+          # Check if head can transition read symbol
+          # Head dies if no transition for symbol
+          if has_transition?(head, symbol)
+            transition(head, symbol).each { |t| newHeads << t }
+          end
+        end
+        heads = newHeads
+        break if heads.empty?
+      end
+      
+      heads.each { |head| return true if accept_state? head }
+      false
+    end
+    
+    ##
+    # Determine the states to transition to from a given
+    # state and input symbol.
+    #
+    # * *Args*:
+    #   - +state+ -> State transitioning from.
+    #   - +input+ -> Input symbol.
+    # * *Returns*:
+    #   The array of transition states. Nil if none.
+    #
+    def transition(state, input)
+      if has_transition?(state, input)
+        dests = @transitions[state][input]
+        dests = [dests] unless dests.kind_of? Array
+        dests
+      else
+        nil
+      end
+    end
+    
+    ##
+    # Determine whether or not a transition exists
+    # for a state, given an input symbol.
+    #
+    # * *Args*:
+    #   - +state+ -> State transitioning from.
+    #   - +input+ -> Input symbol.
+    # * *Returns*:
+    #   Whether a transition exists. (boolean)
+    #
+    def has_transition?(state, input)
+      @transitions[state].has_key? input
+    end
+    
+    ##
+    # Determine if a given state is an accept state.
+    #
+    # * *Args*:
+    #   - +state+ -> The state.
+    # * *Returns*:
+    #   Whether or not the state is an accept state. (boolean)
+    #
+    def accept_state?(state)
+      @accept.include? state
+    end
+  end
+  
+end

data/lib/automata/version.rb

@@ -1,3 +1,3 @@
 module Automata
-  VERSION = "0.0.2"
+  VERSION = "0.0.3"
 end

data/lib/automata.rb

@@ -2,6 +2,7 @@ require "automata/version"
 require 'yaml'
 require "automata/state_diagram"
 require "automata/dfa"
+require "automata/nfa"
 
 module Automata
   # Your code goes here...

data/spec/nfa_spec.rb

@@ -0,0 +1,111 @@
+require 'spec_helper'
+
+describe Automata::NFA do
+  
+  context "Initializing from a valid file" do
+    before do
+      @nfa = Automata::NFA.new(file: 'examples/nfa_sample.yml')
+    end
+    
+    it "should accept 'a'" do
+      @nfa.accepts?('a').should == true
+    end
+    
+    it "should accept 'aa'" do
+      @nfa.accepts?('aa').should == true
+    end
+    
+    it "should accept the empty string" do
+      @nfa.accepts?('').should == true
+    end
+    
+    it "should not accept 'b'" do
+      @nfa.accepts?('b').should == false
+    end
+    
+    it "should accept 'ab'" do
+      @nfa.accepts?('ab').should == true
+    end
+    
+    it "should accept 'abab'" do
+      @nfa.accepts?('abab').should == true
+    end
+    
+    it "should accept 'aab'" do
+      @nfa.accepts?('aab').should == false
+    end
+  end
+  
+  context "Initializing an empty NFA" do
+    before do
+      @nfa = Automata::NFA.new
+    end
+    
+    it "should be created successfully" do
+      @nfa.should be_an_instance_of Automata::NFA
+    end
+  end
+  
+  context "Initializing a NFA by params" do
+    before do
+      states = ['q1','q2','q3','q4']
+      alphabet = ['a','b']
+      start = 'q1'
+      accept = ['q1','q2','q4']
+      transitions = {
+        'q1' => {
+          'a' => ['q2','q3']
+        },
+        'q2' => {
+          'a' => 'q2'
+        },
+        'q3' => {
+          'b' => 'q4'
+        },
+        'q4' => {
+          'a' => 'q3'
+        }
+      }
+      params = {
+        states: states,
+        alphabet: alphabet,
+        start: start,
+        accept: accept,
+        transitions: transitions
+      }
+      @nfa = Automata::NFA.new(params)
+    end
+    
+    it "should be created successfully" do
+      @nfa.should be_an_instance_of Automata::NFA
+    end
+    
+    it "should accept 'a'" do
+      @nfa.accepts?('a').should == true
+    end
+    
+    it "should accept 'aa'" do
+      @nfa.accepts?('aa').should == true
+    end
+    
+    it "should accept the empty string" do
+      @nfa.accepts?('').should == true
+    end
+    
+    it "should not accept 'b'" do
+      @nfa.accepts?('b').should == false
+    end
+    
+    it "should accept 'ab'" do
+      @nfa.accepts?('ab').should == true
+    end
+    
+    it "should accept 'abab'" do
+      @nfa.accepts?('abab').should == true
+    end
+    
+    it "should accept 'aab'" do
+      @nfa.accepts?('aab').should == false
+    end
+  end
+end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: automata
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
   prerelease: 
 platform: ruby
 authors:
@@ -9,11 +9,11 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-04-23 00:00:00.000000000 Z
+date: 2012-04-24 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rake
-  requirement: &70316676891620 !ruby/object:Gem::Requirement
+  requirement: &70308841255600 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ! '>='
@@ -21,10 +21,10 @@ dependencies:
         version: '0'
   type: :development
   prerelease: false
-  version_requirements: *70316676891620
+  version_requirements: *70308841255600
 - !ruby/object:Gem::Dependency
   name: rspec
-  requirement: &70316676891100 !ruby/object:Gem::Requirement
+  requirement: &70308841254660 !ruby/object:Gem::Requirement
     none: false
     requirements:
     - - ~>
@@ -32,7 +32,7 @@ dependencies:
         version: 2.9.0
   type: :development
   prerelease: false
-  version_requirements: *70316676891100
+  version_requirements: *70308841254660
 description: Create and simulate automaton.
 email:
 - jico@baligod.com
@@ -48,11 +48,14 @@ files:
 - Rakefile
 - automata.gemspec
 - examples/dfa_sample.yml
+- examples/nfa_sample.yml
 - lib/automata.rb
 - lib/automata/dfa.rb
+- lib/automata/nfa.rb
 - lib/automata/state_diagram.rb
 - lib/automata/version.rb
 - spec/dfa_spec.rb
+- spec/nfa_spec.rb
 - spec/spec_helper.rb
 homepage: http://github.com/jico/automata
 licenses: []
@@ -68,7 +71,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: -1178858470182539386
+      hash: -1969094852898081340
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
@@ -77,7 +80,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
       segments:
       - 0
-      hash: -1178858470182539386
+      hash: -1969094852898081340
 requirements: []
 rubyforge_project: 
 rubygems_version: 1.8.17
@@ -87,4 +90,5 @@ summary: This gem provides a number of classes to create and simulate Determinis
   Finite Automata, Push-down Automata, and Turing Machines.
 test_files:
 - spec/dfa_spec.rb
+- spec/nfa_spec.rb
 - spec/spec_helper.rb