New Theoretical Computational Results by Chang Chia Hsiang (6 results)

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Condition: New. SUPER FAST SHIPPING.

Buch. Condition: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.

Gebunden. Condition: New.

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.