Answer:
students will be more attentive and active
Explanation:
 
        
             
        
        
        
<h3>What is a Finite automata?</h3>
A finite state machine (FSM) or finite state automaton (FSA), or simply a state machine, is a mathematical model of computation. It is an abstract machine that can be in exactly one of a finite number of states at any given time. The FSM may change from one state to another in response to some input; the change from one state to another is called a transition. An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition. Finite-state machines are of two types - deterministic finite-state machines and non-deterministic finite-state machines. A deterministic finite-state machine can be constructed equivalent to any non-deterministic machine.
With that being said, the DFA is equivalent to the expression 10(0+11)0*1 The expression that you've specified requires at least three 1 to be accepted. Breaking it down into parts. 
<h3>Writting the automata:</h3>
<em>S0: 1 => S1        ; 1 </em>
<em>S0: 0 => error     ; 0 </em>
<em>S1: 0 => S1        ; 10+ </em>
<em>S1: 0 => S2        ; 10(0 </em>
<em>S2: 0 => S2 </em>
<em>S2: 1 => S3 </em>
<em>S3: 1 => S4 </em>
<em>S4: 0 => S4 </em>
<em>S4: 1 => S5 </em>
<em>S5: 1 => S6 (final state) </em>
See more about automata at brainly.com/question/14937298
#SPJ1
 
        
        
        
 Answer:
Primary DNS server
Secondary DNS server
Default gateway
Explanation:
The following tests are performed by ESXi:
-  Pings the subnet gateway that is stated.
- Pings the primary DNS server that is stated.
- Pings the secondary DNS server that is stated.
- Ensure that the hostname of the ESXi host is resolved by it.
Based on the above, the three IP addresses may be pinged by the Test Management Network feature in the ESXi hosts DCUI are are therefore the following: