Subway Automatic Ticketing System Using Finite Automata

Drawing inspiration from the structured nature of Non-Deterministic Finite Automaton (NFA), we present a novel approach to designing and implementing a Subway Automatic Ticketing System. By aligning the functional states of our ticketing system with the transition states of NFA, we establish a parallel between the two domains. Each function within the ticketing system is modeled as a state in the NFA, with user inputs serving as edge cases that guide transitions between these states. This conceptual framework enhances the clarity of system behavior and facilitates robustness and adaptability in the face of diverse ticketing scenarios and passenger interactions. In our investigation, we explored various stages of the ticketing process using an NFA, mapping each stage to a state and mirroring the dynamic interactions between user inputs and system responses. Our model accommodates the possibility of revisiting stages, creating loops that reflect the cyclic behavior present in NFA. This approach not only aids in sequential progression within the ticketing system but also enhances the overall functionality and efficiency of the system.