Formal
Languages
and the
Theory of
Computation

Spring 2006
course
navigation

Josh's test page

I'm just trying to figure out how this all works.

It works great, Josh.

Josh's YAML valid API

# version 0.2 # Text files have .fa extensions # --- at left margin seperate machines in same file # Comments follow pound signs until end of line # words obey the typical "start with a-z,A-Z,0-9,_ # keyword : value # set is { list members } # commas may be replaced by whitespace # null or ~ is empty string states: [ q0, q1, q2 ] alphabet: [ 0, 1 ] start: q0 accept: [ q1 ] transitions: # Q x S -> Q - [ q0, 0, q2 ] - [ q0, 1, q0 ] input: - [ 0, 1, 0, 0, 0, 1, 0, 0, 0, 1 ] - [ 1, 1, 0, 0, 0 ]
http://cs.marlboro.edu/ courses/ spring2006/formal_languages/ wiki/ Joshs_test_page
last modified Thursday August 31 2006 2:24 am EDT