Finite State Machine
Finite state machines (FSMs) are mathematical models representing systems with a finite number of states that transition between each other based on input. Current research focuses on applying FSMs in diverse areas, including reinforcement learning (using reward automata and hierarchical structures), natural language processing (for tasks like question answering and lemmatization), and robotics (comparing FSMs with behavior trees for control). This versatility makes FSMs a powerful tool for modeling and controlling complex systems, impacting fields ranging from software engineering and network security to artificial intelligence and industrial automation.
Papers
CSM-H-R: A Context Modeling Framework in Supporting Reasoning Automation for Interoperable Intelligent Systems and Privacy Protection
Songhui Yue, Xiaoyan Hong, Randy K. Smith
Weakly synchronous systems with three machines are Turing powerful
Cinzia Di Giusto, Davide Ferré, Etienne Lozes, Nicolas Nisse