"This handbook presents a collection of introductory materials on finite state theories and their applications. It offers an open treatment of the types of algorithms and data structures that are typically retained quietly by companies and provides performance information regarding individual techniques for various domain areas. A complete reference on finite state-based models and their applications, the book can be used by beginners as a quick reference guide and by researchers for an in-depth study ofthis area"--
A finite state model, or automata, is a model of behavior composed of a finite number of states, transitions between those states, and actions. They are routinely used in a wide range of fields, and here computer scientists, electrical engineers, mathematicians, and other contributors introduce the fundamentals of automata theory. They also describe some widely used automata, including transducers, tree automata, quantum automata, and timed automata. Other topics include regular path queries of graph-structured data, finite state automata in compiler, Petri nets, and model checking. Annotation ©2012 Book News, Inc., Portland, OR (booknews.com)
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. Handbook of Finite State Based Models and Applications 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.
The book first introduces the fundamentals of automata theory, including regular expressions, as well as widely used automata, such as transducers, tree automata, quantum automata, and timed automata. It then presents algorithms for the minimization and incremental construction of finite automata and describes Esterel, an automata-based synchronous programming language for embedded system software development.
Moving on to applications, the book explores regular path queries on graph-structured data, timed automata in model checking security protocols, pattern matching, compiler design, and XML processing. It also covers other finite state-based modeling approaches and applications, including Petri nets, statecharts, temporal logic, and UML state machine diagrams.
