Technical

University

Isaial

MATH$212$ Fundamentals of Discrete Mathematics

Unit $5$: Introduction to Automata and Additional Topics in Discrete Math

Learning map

Learn: Automata Theory

Learn: Automata Theory

Lesson path

Introduction

Learning material

Graded Questions

Summary

Add back skipped section

is locked.

Once the train enters the tunnel, it cannot communicate with either A or B until it exits.

Assume that the switches are controlled by finite$-$state machines.

If trains arrive simultaneously, which of the following could go wrong?

After receiving the lock message from $A,$ switch $B$ will not transmit its lock request.

Because of bad timing, both trains could be allowed to enter, resulting in a train wreck

The train arriving at $A$ is given unfair preference

The train arriving at $B$ is given unfair preference

Submit answer

Exit