Mealy Machine outputs state
X1/Y1 X2/Y2 S1 X2/Y1 S2 S3 X1/Y2 X2/Y3 X1/Y3 Mealy Machine Graph
X1 X2 X2 X1 X2 S1/Y2 S2/Y1 S3/Y3 X1 Moore Machine Graph
Natural language formulation of a problem Design a control unit for ligth signalization on the railway with car sensors in positions A, B, C. The cars can go BA, AB i AC. In direction BA go only car sets of length larger than the distance between sensors B and A. In directions AB and AC go only single cars of length smaller than distance between sensors A and B and A and C, respectively. The designed circuit should light lamp z=1 if there are no cars between sensors A and B or sensors A and C Sensors A, B, C generate signals a=1, b=1 and c=1 respectively, when sets of cars or single cars occur to be in their close distance.
010 6/1 110 1/0 100 7/1 2/1 000 000 000 100 8/1 001 5/1 3/1 010 4/1 Moore Machine graph for the analyzed device 000
Negated sr FF This version has negated inputs This FF realizes the function: