Automata

Source: Wikipedia. Pages: 87. Chapters: Automata theory, Finite-state machine, Regular expression, Pushdown automaton, Star height problem, Tree automaton, Sequential logic, Abstract machine, UML state machine, DEVS, Quantum dot cellular automaton, Nested word, Finite & Deterministic Discrete Event System Specification, Krohn¿Rhodes theory, Büchi automaton, McNaughton's Theorem, Nondeterministic finite-state machine, SP-DEVS, Quantum finite automata, O-automaton, Finite state transducer, Powerset construction, Behavior of DEVS, State transition table, Mechanical Galleon, Behavior of Coupled DEVS, Semiautomaton, Semi-deterministic büchi automaton, Probabilistic automaton, Thomas Kuntz, Subshift of finite type, De Bruijn graph, Introduction to Automata Theory, Languages, and Computation, Embedded pushdown automaton, Road coloring problem, Deterministic pushdown automaton, Richards controller, Linear bounded automaton, Queue machine, Infinite tree automaton, Timed event system, Synchronizing word, DFA minimization, Muller automaton, Conference on Implementation and Application of Automata, Automatic sequence, Event segment, Tree walking automaton, International Colloquium on Automata, Languages and Programming, Generalized nondeterministic finite-state machine, Augmented transition network, Pebble automaton, Alternating finite automaton, Temporal logic in finite-state verification, CIP-Tool, Well-structured transition system, Generalized star height problem, Hybrid automaton, Star-free language, Moore reduction procedure, PowerDEVS, Discrete system, Deterministic automaton, Nested stack automaton, Levenshtein automaton, Constraint automaton, Generalized Büchi automaton, Automata construction, Implication table, Permutation automaton, Determinization of Automaton, Lazy linear hybrid automaton, Counter automaton, Alternating tree automata. Excerpt: UML state machine is a significantly enhanced realization of the mathematical concept of a finite automaton in Computer Science applications as expressed in the Unified Modeling Language (UML) notation. The concepts behind this are about organizing the way a device, computer program, or other (often technical) process works such that an entity or each of its sub-entities are always in exactly one of a number of possible states and where there are well-defined conditional transitions between these states. UML state machine, known also as UML statechart, is an object-based variant of Harel statechart adapted and extended by UML. UML state machines overcome the main limitations of traditional finite-state machines while retaining their main benefits. UML statecharts introduce the new concepts of hierarchically nested states and orthogonal regions, while extending the notion of actions. UML state machines have the characteristics of both Mealy machines and Moore machines. They support actions that depend on both the state of the system and the triggering event, as in Mealy machines, as well as entry and exit actions, which are associated with states rather than transitions, as in Moore machines. The term "UML state machine" can refer to two kinds of state machines: behavioral state machines and protocol state machines. Behavioral state machines can be used to model the behavior of individual entities (e.g., class instances). Protocol state machines are used to express usage protocols and can be used to specify the legal usage scenarios of classifiers, interfaces, and ports. Many software systems are e...