hello can you please help in my assignment in discreatstructer
Question 7 [6 Marks] Given the Deterministic Finite Automation (DFA) below 1 82 0 0 0,1 (1 mark) i) Write the set of final states for the DFA. ii) Construct a transition table for the DFA. (3 marks) iii) Find the sequence of configurations and state if the string 0011101100 is accepted by the DFA? (2 marks)
hello can you please help in my assignment in discreat structer
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am