Explanations 
Textbooks 
Flashcards 
91影视 AI 
Notes 
Study Plans 
Study Sets 
Find a degree 
Magazine Problem 21
Write a grammar that generates the strings having the given property. Exponential numbers (numbers including floating-point numbers and numbers such as \(6.9 \mathrm{E} 3,8 \mathrm{E} 12,9.6 \mathrm{E}-4,9 \mathrm{E}-10)\)
Problem 21
Design nondeterministic finite-state automata that accept the strings over \(\\{a, b\\}\) having the properties specified. Starting either \(a b b\) or \(b a\)
Problem 21
Draw the transition diagram of a finite-state automaton that accepts the given set of strings over \(\\{a, b\\}\). Even number of \(a\) 's
Problem 21
In Exercises \(21-26,\) design a finite-state machine having the given properties. The input is always a bit string. Outputs 1 if an even number of 1 's have been input; otherwise, outputs 0
Problem 22
Draw the transition diagram of a finite-state automaton that accepts the given set of strings over \(\\{a, b\\}\). At least one \(b\)
Problem 22
Write a grammar that generates the strings having the given property. All strings over \(\\{a, b\\}\)
Problem 22
Design a finite-state machine having the given properties. The input is always a bit string. Outputs 1 if two or more 1 's are input; otherwise, outputs 0
Problem 22
Design nondeterministic finite-state automata that accept the strings over \(\\{a, b\\}\) having the properties specified. Containing either \(a b b\) or \(b a\)
Problem 23
Draw the transition diagram of a finite-state automaton that accepts the given set of strings over \(\\{a, b\\}\). Exactly one \(b\)
Problem 23
Design a finite-state machine having the given properties. The input is always a bit string. Outputs 1 if \(k\) 1's have been input, where \(k\) is a multiple of 3 ; otherwise, outputs 0
