HW #2 Finite State Machine: CSCI 260 Data Structures
JavaMIT
finite-state-Machine-in-Java
NYIT CSCI 260 Data structures HW #2
A finite state automaton (this jargon is irrelevant to this problem) requires a specific string S. S
must be made of only letters a and b. In addition, S must satisfy the format a^(n+1) b^n