Beschreibung:
Applicable to any problem that requires a finite number of solutions, finite state-based models (also called finite state machines or finite state automata) have found wide use in various areas of computer science and engineering. This handbook provides a complete collection of introductory materials on finite state theories, algorithms, and the latest domain applications. For beginners, the book is a handy reference for quickly looking up model details. For more experienced researchers, it is suitable as a source of in-depth study in this area.
Finite Automata. Large-Scale Regular Expression Matching on FPGA. Finite State Transducers. Tree Automata. Timed Automata. Quantum Finite Automata. Finite Automata Minimization. Incremental Construction of Finite-State Automata. Esterel and the Semantics of Causality. Regular Path Queries on Graph-Structured Data. Applying Timed Automata to Model Checking of Security Protocols. Optimal Adaptive Pattern-Matching Using Finite State Automata. Finite State Automata in Compilers. Finite State Models for XML Processing. Petri Nets. Statecharts. Model Checking. System Modeling with UML State Machines. Index.