Request for Comments (RFC) are documents that contains technical and organizational specifications about the Internet. The...

  

Transcribed Image Text:

Request for Comments (RFC)¹ are documents that contains technical and organizational specifications about the Internet. The RFCs are produced by the Internet Engineering Task Force (IETF), the Internet Research Task Force (IRTF), the Internet Architecture Board (IAB), and Independent Submissions. RFCs usually start off as an Internet Draft (ID) and depending on their maturity level they may attain different statuses such as, Internet Standard (ISD), Proposed Standard (PSD), Best Current Practice (BCP), Experimental (EXP), Informational (INF), and Historic (HIS). Meaning, all Internet Draft may not end up as an Internet Standard. Each RFC document has a number of the form RFCxxxx (where xxxx goes from 0000 to 9999) and have different status as explained above. a) Consider the above scenario and construct a simplest possible nondeterministic finite automaton (NFA) to recognize RFCs and their status for the following strings: RFCxxxx-ID RFCXXXX-INF RFCxxxx-ISD The NFA constructed should reach the final state to accept the above strings. Note that xxxx can be any digits from 0000 to 9999. b) Construct a simplest possible deterministic finite automaton (DFA) for the NFA you have constructed in Question 2 a) above. Request for Comments (RFC)¹ are documents that contains technical and organizational specifications about the Internet. The RFCs are produced by the Internet Engineering Task Force (IETF), the Internet Research Task Force (IRTF), the Internet Architecture Board (IAB), and Independent Submissions. RFCs usually start off as an Internet Draft (ID) and depending on their maturity level they may attain different statuses such as, Internet Standard (ISD), Proposed Standard (PSD), Best Current Practice (BCP), Experimental (EXP), Informational (INF), and Historic (HIS). Meaning, all Internet Draft may not end up as an Internet Standard. Each RFC document has a number of the form RFCxxxx (where xxxx goes from 0000 to 9999) and have different status as explained above. a) Consider the above scenario and construct a simplest possible nondeterministic finite automaton (NFA) to recognize RFCs and their status for the following strings: RFCxxxx-ID RFCXXXX-INF RFCxxxx-ISD The NFA constructed should reach the final state to accept the above strings. Note that xxxx can be any digits from 0000 to 9999. b) Construct a simplest possible deterministic finite automaton (DFA) for the NFA you have constructed in Question 2 a) above.

Answer rating: 100% (QA)

For sake of simplicity letly take E R F ... View the full answer