Consider the following pushdown automata (pda) where s is the starting state and f is the favorable state:

(s, a, aa) ? (s, a); (s, a, ? ) ? (s, a); (s, b, a) ? (f, ? ); (f, b, a) ? (f, ? ); (f, a, a) ? (f, ? )

give the computation of the pda (give the state, input string still to be read, and top of the stack symbol (a, b, ? ) on the string aaabba, abbaaa, and baba. determine which of the strings are accepted by the pda.
determine the language accepted by the pda.

Whree is the graph budd

Ibelieve its true but not sure hope this .

Solution: the categorization of functional and non-functional requirement are as follows: some of the more typical functional requirements include: • business rules• transaction corrections, adjustments and cancellations• administrative functions• authentication• authorization levels• audit tracking• external interfaces• certification requirements• reporting requirements• historical data• legal or regulatory requirementswhile,some typical non-functional requirements are: • performance – for example response time, throughput, utilization, static volumetric• scalability• capacity• availability• reliability• recoverability• maintainability• serviceability• security• regulatory• manageability• environmental• data integrity• usability• interoperability