Articoli correlati a New Theoretical and Computational Results for Regular...
Sinossi
Excerpt from New Theoretical and Computational Results for Regular Languages
A nondeterministic finite automata (abbr. Nfa) M is a 5-tuple F, where Q is a set of states, I g Q is the set of initial states, F g Q is the set of final states, and 6 C Q x (2 x Q) is a labeled directed graph with vertices Q and an edge labeled a connecting state q to state p for every p]] belonging to 6. For all q 6 Q and a 6 2 we use the notation b(q,a) to denote the set {p [q, E 6} of all statesreachable from state q by a single edge labeled a It is useful to generalize this notation with the following rules, where T C Q, s E E', and B C E.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 14,94
GRATIS per la spedizione da Regno Unito a U.S.A.
Destinazione, tempi e costiAltre edizioni note dello stesso titolo
Risultati della ricerca per New Theoretical and Computational Results for Regular...
Immagini fornite dal venditore
New Theoretical and Computational Results for Regular Languages
Print on DemandDa: Forgotten Books, London, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: 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. Codice articolo 9781333307738_0
Quantità: Più di 20 disponibili
Foto dell'editore
New Theoretical and Computational Results for Regular Languages Classic Reprint
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333307738
Quantità: 15 disponibili
Foto dell'editore
New Theoretical and Computational Results for Regular Languages Classic Reprint
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000. Codice articolo LW-9781333307738
Quantità: 15 disponibili