Constructre’s for following languages over σ= {0,1}
i. all words in which "1" never follows "0". ( "0" neverappears before "1")
ii. all words which begin and end withdifferent letters.
b) how many minimumstates can be there in an nfa of language having all word with"101" at the end? (4)

Write a program which asks you to enter a name in the form of first middle initial last. so you might enter for example samuel p. clemens. use getline to read in the string because it contains spaces. also, apparently the shift key on your keyboard doesn’t work, because you enter it all lower case. pass the string to a function which uses .find to locate the letters which need to be upper case and use toupper to convert those characters to uppercase. the revised string should then be returned to main in the form last, first mi where it will be displayed.

Which part of the cpu accepts data?

After you present a proposal, the committee starts asking you questions, some beyond the strict focus of your proposal. they ask questions about implications in other fields and knowledge about other fields. you are asked to redo your proposal. what is most likely missing? breadth of material depth of material clarity of material details of material