Finite Automata simulator

all files | finite_automata docs,code | web app script,template

---

---

file: '_sample.fa'

# # This is a *.fa (i.e. finite automata) definition file # which follows the yaml.org data format. # The ~ character is used to refer to the empty string. # The automata below is non-deterministic, since both # ~ and lists of symbols are used in the transition table. # start: s accept: [ q0, r0 ] transitions : # state x alpha -> state - [ s, ~, q0 ] - [ s, ~, r0 ] - [ q0, 1, q1 ] - [ q1, 1, q0 ] - [ r0, [0,1], r1 ] - [ r1, [0,1], r2 ] - [ r2, [0,1], r0 ] tests : - [ yes, ~ ] - [ no, 00000 ] - [ yes, 1111 ] - [ no, 1010 ] - [ yes, 111000 ]

---

---

Running finite_automata on _sample.fa .

===== _sample.fa =====
 states : [ q0, q1, r0, r1, r2, s ] 
 accept : [ q0, r0 ]
 alphabet : [ 0, 1 ] 
 start : s
 tests : 
   yes   [  ]
   no    [ 0, 0, 0, 0, 0 ]
   yes   [ 1, 1, 1, 1 ]
   no    [ 1, 0, 1, 0 ]
   yes   [ 1, 1, 1, 0, 0, 0 ]
 transitions :
   q0      x  1             =>  q1    
   q1      x  1             =>  q0    
   r0      x  [ 0, 1 ]      =>  r1    
   r1      x  [ 0, 1 ]      =>  r2    
   r2      x  [ 0, 1 ]      =>  r0    
   s       x  ~             =>  q0    
   s       x  ~             =>  r0    
 analysis :
   It's not a strict DFA.
   Running inputs and tests :
     '' => yes (ok)
     '00000' => no (ok)
     '1111' => yes (ok)
     '1010' => no (ok)
     '111000' => yes (ok)
   Passed all 5 tests.
   Diagram created in file '_sample.png'

---