Paperback. This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds. - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9783540514985

Contact seller

Report this item

Bibliographic Details

Title: Fundamentals of Computation Theory (Paperback)
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Publication Date: 1989
Language: English
ISBN 10: 3540514988
ISBN 13: 9783540514985
Binding: Paperback
Condition: new

About this title

Synopsis

This volume contains the proceedings of the conference on Fundamentals of Computation Theory held in Szeged, Hungary, August 21-25, 1989. The conference is the seventh in the series of the FCT conferences initiated in 1977 in Poznan-Kornik, Poland. The papers collected in this volume are the texts of invited contributions and shorter communications falling into one of the following sections: - Efficient Computation by Abstract Devices: Automata, Computability, Probabilistic Computations, Parallel and Distributed Computing; - Logics and Meanings of Programs: Algebraic and Categorical Approaches to Semantics, Computational Logic, Logic Programming, Verification, Program Transformations, Functional Programming; - Formal Languages: Rewriting Systems, Algebraic Language Theory; - Computational Complexity: Analysis and Complexity of Algorithms, Design of Efficient Algorithms, Algorithms and Data Structures, Computational Geometry, Complexity Classes and Hierarchies, Lower Bounds.

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Seller's business information

APOLLO ONLINE CORP.
605 Geddes Street, Wilmington, DE, 19805, U.S.A.

Sale & Shipping Terms

Terms of Sale

We guarantee the condition of every book as it�s described on the Abebooks web sites. If you�ve changed
your mind about a book that you�ve ordered, please use the Ask bookseller a question link to contact us
and we�ll respond within 2 business days.
Books ship from California and Michigan.

Shipping Terms

Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.

Books ship from California and Michigan.

If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	6 to 16 business days	6 to 14 business days
First item	US$ 0.00	US$ 0.00

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.