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
Overview of Test Coverage Criteria for Test Case Generation from Finite State Machines Modelled as Directed Graphs
Vaclav Rechtberger, Miroslav Bures, Bestoun S. Ahmed
Prioritized Variable-length Test Cases Generation for Finite State Machines
Vaclav Rechtberger, Miroslav Bures, Bestoun S. Ahmed, Youcef Belkhier, Jiri Nema, Hynek Schvach