Difference: CSC122F2022Lab2NFSM (1 vs. 4)

Revision 42022-08-23 - cathybareiss

Line: 1 to 1
Changed:
<
<
META TOPICPARENT name="CSC122SylS2022"
>
>
META TOPICPARENT name="CSC122SylF2022"
 

Nondeterministic Finite State Machine

This has been changed to be an extra credit for lab 1

A nondeterministic finite state machine is a finite state machine that allows for the changing of a state with no use of input and/or multiple options for a given state and input. Geeks for Geeks can explain it but the nice thing about this lab is you DON'T need to understand everything in that website. Your goal is to adapt a solution for the previous program to determine if a given machine is deterministic or not and to run it (in either case) on a given string.

Revision 32022-08-22 - cathybareiss

Line: 1 to 1
 
META TOPICPARENT name="CSC122SylS2022"

Nondeterministic Finite State Machine

Added:
>
>		This has been changed to be an extra credit for lab 1

 A nondeterministic finite state machine is a finite state machine that allows for the changing of a state with no use of input and/or multiple options for a given state and input. Geeks for Geeks can explain it but the nice thing about this lab is you DON'T need to understand everything in that website. Your goal is to adapt a solution for the previous program to determine if a given machine is deterministic or not and to run it (in either case) on a given string.

Objectives

  1. Refresh programming skills especially in regards to recursion

Revision 22022-08-16 - cathybareiss

Line: 1 to 1
 
META TOPICPARENT name="CSC122SylS2022"

Nondeterministic Finite State Machine

A nondeterministic finite state machine is a finite state machine that allows for the changing of a state with no use of input and/or multiple options for a given state and input. Geeks for Geeks can explain it but the nice thing about this lab is you DON'T need to understand everything in that website. Your goal is to adapt a solution for the previous program to determine if a given machine is deterministic or not and to run it (in either case) on a given string.
Line: 7 to 7
 
  1. Learn more about finite state machines.

Assignment

  1. Complete the program described above. You will have access to a solution if you wish to use it instead of your own from the previous lab.
Changed:
<
<
  1. Add a method called isDeterministic to the FSM class that returns a boolean to indicate if the machine is deterministic or nondeterministic
  2. Add a method call nTest that returns ACCEPT or REJECT if a nondeterministic machine accepts or rejects a string. It should only reject if all possible paths fail
>
>
  1. Add a method called isDeterministic to the FSM class that returns a boolean to indicate if the machine is deterministic or nondeterministic
  2. Add a method call nTest that returns ACCEPT or REJECT if a nondeterministic machine accepts or rejects a string. It should only reject if all possible paths fail
  a. You may assume you will not get caught in an infinite recursive situation.
  1. Change in input a. File the lines of transitions a "\" indicates and null transition (i.e. does not use up any input)

Revision 12022-08-08 - cathybareiss

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="CSC122SylS2022"

Nondeterministic Finite State Machine

A nondeterministic finite state machine is a finite state machine that allows for the changing of a state with no use of input and/or multiple options for a given state and input. Geeks for Geeks can explain it but the nice thing about this lab is you DON'T need to understand everything in that website. Your goal is to adapt a solution for the previous program to determine if a given machine is deterministic or not and to run it (in either case) on a given string.

Objectives

  1. Refresh programming skills especially in regards to recursion
  2. Learn more about finite state machines.

Assignment

  1. Complete the program described above. You will have access to a solution if you wish to use it instead of your own from the previous lab.
  2. Add a method called isDeterministic to the FSM class that returns a boolean to indicate if the machine is deterministic or nondeterministic
  3. Add a method call nTest that returns ACCEPT or REJECT if a nondeterministic machine accepts or rejects a string. It should only reject if all possible paths fail a. You may assume you will not get caught in an infinite recursive situation.
  4. Change in input a. File the lines of transitions a "\" indicates and null transition (i.e. does not use up any input)
  5. Be sure to modify the comments as appropriate and maintain good programming techniques

Submission instructions

  1. Complete the SDR. Be aware that the form has changed! Include at least one more set of tests for your own machine along with any other tests you think are appropriate. Your testing report should probably not be more than a page and could be less.
  2. Combine your SDR and all of your .java and testing files into one zip folder
  3. Submit the zip folder on Canvas by the due data specific there.

Restriction:

It is very likely that there are programs that can be downloaded that can simulate a FSM and/or a NFSM. You are not allowed to even look at these. The code provided is what you should use. This assignment is to bring back your programming skills.

Challenges

  1. Determine if the machine could cause infinite recursion. There is not help for this (and you are not allowed to use the Internet). Try to determine what would cause infinite recursion or an infinite loop and test for that. This is a serious challenge. Don't even think about it until you finish rest of the assignment with good clean code and you have caught up with all other homework and studying for all your other classes!!!!
View topic | History: r4 < r3 < r2 < r1 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2026 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback