Excerpt from A Further Note on Top-Down Deterministic Languages
A survey of the approaches to top - down deterministic languages has been given in Wood (l969a), however since that time some earlier unpublished work by Schorre (1965) and Tixier (1967) has come to light. The aim of this paper is to investigate their approach, relating it to the ll(k) languages of Lewis and Stearns At the same time we take this opportunity to generalize some results of Korenjak and Hopcroft (1966) and to include a survey of the non closure results for ll(k) languages, some of which are new.
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.
"synopsis" may belong to another edition of this title.
Excerpt from A Further Note on Top-Down Deterministic Languages
A survey of the approaches to top - down deterministic languages has been given in Wood (l969a), however since that time some earlier unpublished work by Schorre (1965) and Tixier (1967) has come to light. The aim of this paper is to investigate their approach, relating it to the ll(k) languages of Lewis and Stearns At the same time we take this opportunity to generalize some results of Korenjak and Hopcroft (1966) and to include a survey of the non closure results for ll(k) languages, some of which are new.
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.
Eugene Fink received his B.S. degree from Mount Allison University (Canada) in 1991, M.S. from the University of Waterloo (Canada) in 1992, and Ph.D. from Carnegie Mellon University (USA) in 1999. He has been an assistant professor in the Computer Science and Engineering Department at the University of South Florida (USA) since 1999. His research interests include computational geometry, artificial intelligence, machine learning, and e-commerce.
Derick Wood received his B.Sc. (1963) and Ph.D. (1968) from the University of Leeds (UK). He was a Postdoctoral Fellow at the Courant Institute, New York University (USA), from 1968 to 1970, and then joined McMaster University (Canada) in 1970. He was a professor at the University of Waterloo (Canada) from 1982 to 1992, at the University of Western Ontario (Canada) from 1992 to 1995, and at the Hong Kong University of Science and Technology since 1995. He has published widely in a number of research areas and written two textbooks, "Theory of Computation" (John Wiley, 1987) and "Data Structures, Algorithms, and Performance" (Addison-Wesley, 1993).
"About this title" may belong to another edition of this title.
Seller: Forgotten Books, London, United Kingdom
Paperback. Condition: New. Print on Demand. This book presents an in-depth analysis of top-down deterministic languages, a specific type of formal language used in computer science to describe the structure of programming languages. The author introduces two new families of languages, F(k) and U(k), which generalize top-down deterministic languages and provide new characterizations of s-grammars and LL(1) languages. The book also explores the closure properties of LL(k), F(k), and U(k) languages, providing a comprehensive understanding of their behavior under various operations. Additionally, the author establishes the existence of non-degenerate hierarchies for the F(k) and U(k) language families. By extending the notion of separability and introducing new families of languages, this book deepens our understanding of formal languages and their applications in computer science. 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 # 9781332130382_0
Quantity: Over 20 available
Seller: PBShop.store US, Wood Dale, IL, U.S.A.
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332130382
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000. Seller Inventory # LW-9781332130382
Quantity: 15 available