Finite Automaton

Finite automata are mathematical models of computation representing systems with a finite number of states that transition between states based on input. Current research focuses on efficient algorithms for constructing and learning these automata, particularly in the context of large language models, and their application in areas like language processing, anomaly detection, and control synthesis. This work addresses challenges such as handling large-scale data, incorporating probabilistic and weighted transitions, and improving the interpretability and efficiency of automata-based systems, leading to advancements in both theoretical understanding and practical applications.