Items related to New Theoretical and Computational Results for Regular...
Synopsis
This book is an examination of finite automata, particularly regular expressions in the context of regular languages. It takes a theoretical yet practical approach to the study of automata, going over important historical algorithms like the Rabin and Scott algorithm along with more recent innovations from the author and Berry and Sethi. The theoretical work is complemented by a study of how to implement these algorithms and their efficiency. At the heart of this book is a new algorithm for constructing finite automata from regular expressions, which is shown to be superior to previous approaches both in terms of the amount of space required and the speed of operation. The book also includes a discussion of how to use these finite automata to construct deterministic finite automata, which are more efficient for certain applications. Overall, this book provides a comprehensive and up-to-date treatment of finite automata and regular languages, making it a valuable resource for students and researchers in theoretical computer science and related fields.
"synopsis" may belong to another edition of this title.
Buy New
View this item
US$ 17.22
FREE shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for New Theoretical and Computational Results for Regular...
Seller Image
New Theoretical and Computational Results for Regular Languages
Print on DemandSeller: Forgotten Books, London, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: New. Print on Demand. This book is an examination of finite automata, particularly regular expressions in the context of regular languages. It takes a theoretical yet practical approach to the study of automata, going over important historical algorithms like the Rabin and Scott algorithm along with more recent innovations from the author and Berry and Sethi. The theoretical work is complemented by a study of how to implement these algorithms and their efficiency. At the heart of this book is a new algorithm for constructing finite automata from regular expressions, which is shown to be superior to previous approaches both in terms of the amount of space required and the speed of operation. The book also includes a discussion of how to use these finite automata to construct deterministic finite automata, which are more efficient for certain applications. Overall, this book provides a comprehensive and up-to-date treatment of finite automata and regular languages, making it a valuable resource for students and researchers in theoretical computer science and related fields. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Seller Inventory # 9781333307738_0
Quantity: Over 20 available
Stock Image
New Theoretical and Computational Results for Regular Languages Classic Reprint
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333307738
Quantity: 15 available
Stock Image
New Theoretical and Computational Results for Regular Languages Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 5 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781333307738
Quantity: 15 available