Construct a finite-state machine for a restricted
Chapter , Problem 15E(choose chapter or problem)
Problem 15E
Construct a finite-state machine for a restricted telephone switching system that implements these rules. Only calls to the telephone numbers 0, 911, and the digit 1 followed by 10-digit telephone numbers that begin with 212, 800, 866.877, and 888 are sent to the network. All other strings of digits are blocked by the system and the user hears an error message.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer