In Ocaml, the following NFA, and assuming you have function shift nfa qs s Type: ('q, 's) nfa_t -> 'q list -> 's option -> 'q list write the function e_closure nfa qs of type Type: ('q, 's) nfa_t -> 'q list -> 'q list This function takes as input an NFA nfa and a set of initial states qs. It outputs a set of states that the NFA might be in after making zero or more epsilon transitions from any state in qs. You can assume the initial states are valid.   type ('q, 's) transition = 'q * 's option * 'q type ('q, 's) nfa_t = { sigma : 's list; qs : 'q list; q0 : 'q; fs : 'q list; delta : ('q, 's) transition list; }     If function works, it should give the following let nfa_ex = { sigma = ['b']; qs = [1; 2; 3]; q0 = 1; fs = [3]; delta = [(1, Some 'b', 2); (2, None, 3)] } e_closure nfa_ex [1] = [1] e_closure nfa_ex [1] = [2;3] e_closure nfa_ex [3] = [3] e_closure nfa_ex [1;2] = [1;2;3]

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

In Ocaml, the following NFA, and assuming you have function

shift nfa qs s

Type: ('q, 's) nfa_t -> 'q list -> 's option -> 'q list

write the function e_closure nfa qs of type Type: ('q, 's) nfa_t -> 'q list -> 'q list

This function takes as input an NFA nfa and a set of initial states qs. It outputs a set of states that the NFA might be in after making zero or more epsilon transitions from any state in qs. You can assume the initial states are valid.

 

type ('q, 's) transition = 'q * 's option * 'q type ('q, 's)

nfa_t = { sigma : 's list; qs : 'q list; q0 : 'q; fs : 'q list; delta : ('q, 's) transition list; }

 

 

If function works, it should give the following

let nfa_ex = { sigma = ['b']; qs = [1; 2; 3]; q0 = 1; fs = [3]; delta = [(1, Some 'b', 2); (2, None, 3)] }

e_closure nfa_ex [1] = [1] e_closure nfa_ex [1] = [2;3] e_closure nfa_ex [3] = [3] e_closure nfa_ex [1;2] = [1;2;3]

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Properties of CSS
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education