Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

please write in C! Consider the finite state machine shown in Figure 1. This machine detects a sequence of characters that consist of zero or

please write in C! image text in transcribed
Consider the finite state machine shown in Figure 1. This machine detects a sequence of characters that consist of zero or more 'A' characters followed by a 'B' and then a 'D', or the sequence 'ABD'. These two patterns can be expressed using the notation (A'B | AC)D. The *** symbol specifies zero or more occurrences and the 'l' symbol specifies logical OR. For example, the following character patterns will be detected by the machine: BD ABD AABD AAABD ACD no od Figure 1. Finite state machine for detecting pattern (A'BAC)D. Write a program to implement the machine using the while()-switch() mechanism shown in class on Tuesday February 18. The circles represent machine states with the integer state value shown in the circle. To transition from one state to another where there is no character shown on an edge, perform an iteration of the while loop. If an edge has an associated letter, that character must be read using gefchar() to transition states. Using the keyboard, enter several character patterns to verify detection. For example, typing the sequence CDAABCAAABDDACDAAC should report two pattern occurrences. Terminate the machine anytime EOF is read (i.e. ctrl-d). Consider the finite state machine shown in Figure 1. This machine detects a sequence of characters that consist of zero or more 'A' characters followed by a 'B' and then a 'D', or the sequence 'ABD'. These two patterns can be expressed using the notation (A'B | AC)D. The *** symbol specifies zero or more occurrences and the 'l' symbol specifies logical OR. For example, the following character patterns will be detected by the machine: BD ABD AABD AAABD ACD no od Figure 1. Finite state machine for detecting pattern (A'BAC)D. Write a program to implement the machine using the while()-switch() mechanism shown in class on Tuesday February 18. The circles represent machine states with the integer state value shown in the circle. To transition from one state to another where there is no character shown on an edge, perform an iteration of the while loop. If an edge has an associated letter, that character must be read using gefchar() to transition states. Using the keyboard, enter several character patterns to verify detection. For example, typing the sequence CDAABCAAABDDACDAAC should report two pattern occurrences. Terminate the machine anytime EOF is read (i.e. ctrl-d)

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

More Books

Students also viewed these Databases questions