Handbook of Finite State Based Models and Applications
1st Edition
Published on 19. April 2016
409 pages
978-1-4398-4619-3 (ISBN)
Description
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 fini
More details
Series
Edition
1. Auflage
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
College/higher education
Computer scientists in the theory of computation and algorithms, mathematicians in finite automata, and software engineers.
Illustrations
209 s/w Abbildungen, 28 s/w Tabellen
209 b/w images, 28 tables and Approx 224 equations
File size
3,20 MB
ISBN-13
978-1-4398-4619-3 (9781439846193)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
11/2016
CRC Press
€92.00
Shipment within 10-20 days
Book
10/2012
1st Edition
Chapman & Hall/CRC
€230.50
Article not available at the moment
Person
Jiacun Wang is an associate professor and the chair of the Department of Computer Science and Software Engineering at Monmouth University in West Long Branch, New Jersey. Dr. Wang is a senior member of IEEE and an associate editor of IEEE Transactions on Systems, Man and Cybernetics, Part C. His research interests include software engineering, discrete event systems, formal methods, wireless networking, and real-time distributed systems.
Content
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.
