The document discusses summarizing the behavior of a nondeterministic finite state machine (NDFSM) by describing its characteristic function. It notes that to describe the NDFSM in words, one should start by explaining what inputs the machine accepts based on its diagram. It then provides an example characteristic function for a NDFSM that accepts binary strings whose decimal equivalent is divisible by 4. The function states that the language L consists of all strings n such that n is a binary string whose decimal value is always divisible by 4.
24 ĐỀ THAM KHẢO KÌ THI TUYỂN SINH VÀO LỚP 10 MÔN TIẾNG ANH SỞ GIÁO DỤC HẢI DƯ...
I understand how the NDFSM works i just cant seem to put it into my .pdf
1. I understand how the NDFSM works i just cant seem to put it into my own words. One has to
give the charactersitic function for the NDFSM Edit View Go Tools Window Help Hw2 FSMs s
17.pdf (page 1 of 20 Edited 1. (4 points) E-(0,1) the language over accepted by the NFSM below.
Give a characteristic function for Lthat interprets the strings in Las encodings of binary numbers.
For example, the binary encoding a prime or binary of a number 2). characteristic function would
not be putting the diagram into words, starting with something like "on input MacBook Pro
Solution
The characterstic function of the given language is given as follows:
L= {n: n is a binary string whose decimal equivalent will always divisible by 4}
If we observe our NFSM we can see the accepted string is either ending with 0 or 00. The string
0 is equivalent to 0 taht means divisible by 4 and if there is 1 preceding 00 then it is divisible by
4 and if 0 is there then also the string is divisible by 4.