FPGAs are

a$.$programmable.

b$.$"field" programmable.

c$.$gate arrays.

d$.$ all of the above.

The ASM design methodology for the design of Finite State Machines

a$.$consists of iteratively refining an algorithm for a design, via an ASM Chart.

b$.$uses "flow chart" symbols of $($State Box$)$ Rectangles, $($Decision$)$ Diamonds, and $($Conditional Output$)$

Ovals.

c$.$is more useful than "classical" State Graphs for practical, applied digital design, like controllers.

d$.$ all of the above.

The classical State Graph design methodology for the design of Finite State Machines

a$.$consists of plotting out a binary string $($to be recognized$/$accepted$),$ then filling in the rest of the

states$/$transitions by exhaustively looking at input combinations.

B$.$ uses circles to denote states and directed arcs to show input$-$generated transitions from state to state.

c$.$is typically used in Computer Automata theory to categorize languages $($types of binary strings$)$ and the

machines $($types of computers$)$ that can accept them.

d$.$all of the above.