Quick Overview

Implement a deterministic finite automaton simulator for strings over a and b, including empty input and explicit accepting states. Demonstrate careful transition-table traversal, start-state handling, acceptance after complete input, and linear-time complexity.

Simulate a Deterministic Finite Automaton

Company: Point72

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Online Assessment

Overview: Implement a deterministic finite automaton simulator for strings over a and b, including empty input and explicit accepting states. Demonstrate careful transition-table traversal, start-state handling, acceptance after complete input, and linear-time complexity.

Loading…