Question

I need to work out a traffic light controllers sequential logic using d flip flops. There are only 2 lights; Side street and Main street. The input has the clock, long timer (20s) and short timer (4s). The output is the codes required to change the light. The side street HAS to be green when the main street is red to let cars through. I have included the next state table and state diagram but am unsure how group the karnaugh maps to get the boolean expression on how to implement the logic. The logic can also only use NAND gates.

TL= Long timer   TS= Short timer

s: C レIS TLTS 兀无 M:C resent steke Net Stabe Condition o t α.ao De

Answer 1

andゾ。 ㄨㄧㄧㄨ 臼 01 a TL.Q co T ON POCO F1