| Abstract: |  This document is an overview of basic sequences of finite-state machines. A sequence is a sorted list of inputs or outputs. An automaton changes its current state according to an input sequence and gives an output sequence as a response. Input sequences are used for state classification or even for machine characterization. Basic sequences include a sequence that distinguishes a state from the others, a sequence verifying that machine is in a particular state and a sequence that determines the current state of machine after its application. Besides a definition and an usage of a sequence, a search algorithm with derivation of its time complexity is provided for each sequence. An improvement based on search algorithm A* is introduced for some of algorithms.
|
|---|