How many nibbles make one kilobyte
2 answers:
You might be interested in
Answer:
Kindly note that, you're to replace "at" with shift 2 as the brainly text editor can't accept the symbol
Explanation:
A graphical user interface (GUI) allows a user to interact with a computer program using a pointing device that manipulates small pictures on a computer screen. The small pictures are called icons or widgets. Various types of pointing devices can be used, such as a mouse, a stylus pen, or a human finger on a touch screen
import java.awt.Color;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JPanel;
import javax.swing.JTextField;
public class LuckyButtons {
static JFrame frame = new JFrame("Lucky Buttons");
static JPanel panel = new JPanel();
public static void main(String s[]) {
panel.setLayout(null);
final JTextField txt1 = new JTextField(10);
txt1.setBounds(200, 50, 100, 30);
// password field
final JTextField txt2 = new JTextField(10);
txt2.setBounds(320, 50, 100, 30);
txt1.setEnabled(false);
txt2.setEnabled(false);
JButton btn1 = new JButton();
btn1.setText("I feel lucky! :)");
btn1.setBounds(200, 150, 130, 20);
JButton btn2 = new JButton();
btn2.setText("I don't feel lucky :(");
btn2.setBounds(350, 150, 150, 20);
btn1.addActionListener(new ActionListener() {
"at"Override
public void actionPerformed(ActionEvent aE) {
txt1.setText("I feel lucky! :)");
txt2.setText("I feel lucky! :)");
panel.setBackground(Color.red);
}
});
btn2.addActionListener(new ActionListener() {
"at"Override
public void actionPerformed(ActionEvent aE) {
txt1.setText("I don't feel lucky :(");
txt2.setText("I don't feel lucky :(");
panel.setBackground(Color.white);
}
});
panel.add(txt1);
panel.add(txt2);
panel.add(btn1);
panel.add(btn2);
frame.add(panel);
frame.setSize(600, 300);
frame.setLocationRelativeTo(null);
frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
frame.setVisible(true);
}
}
Kindly check the attached image below for the code output.
<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