Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)

4 avg rating
( 1 ratings by Goodreads )
 
9780817637194: Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
View all copies of this ISBN edition:
 
 

The study of the connections between mathematical automata and for­ mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first­ order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log­ ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup­ theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor­ mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com­ puter science community, which moved to other concerns.

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

Other Popular Editions of the Same Title

9783764337193: Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)

Featured Edition

ISBN 10:  3764337192 ISBN 13:  9783764337193
Publisher: Birkhauser Verlag AG, 1993
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

Howard Straubing
Published by Birkh?user (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Birkh?user, 1994. Hardcover. Condition: New. 1994. Seller Inventory # DADAX0817637192

More information about this seller | Contact this seller

Buy New
US$ 67.98
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

2.

Howard Straubing
Published by Birkhäuser (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 1
Seller:
Irish Booksellers
(Portland, ME, U.S.A.)
Rating
[?]

Book Description Birkhäuser, 1994. Condition: New. book. Seller Inventory # M0817637192

More information about this seller | Contact this seller

Buy New
US$ 115.84
Convert currency

Add to Basket

Shipping: US$ 3.27
Within U.S.A.
Destination, rates & speeds

3.

Howard Straubing
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Quantity Available: 1
Seller:
BennettBooksLtd
(San Diego, CA, U.S.A.)
Rating
[?]

Book Description Condition: New. New. Seller Inventory # STR-0817637192

More information about this seller | Contact this seller

Buy New
US$ 132.35
Convert currency

Add to Basket

Shipping: US$ 4.95
Within U.S.A.
Destination, rates & speeds

4.

Howard Straubing
Published by BIRKHAUSER BOSTON INC, United States (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)
Rating
[?]

Book Description BIRKHAUSER BOSTON INC, United States, 1994. Hardback. Condition: New. 1994 ed.. Language: English . This book usually ship within 10-15 business days and we will endeavor to dispatch orders quicker than this where possible. Brand New Book. The study of the connections between mathematical automata and for- mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first- order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log- ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960 s with the work of J. Richard Biichi on monadic second-order logic. Biichi s investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup- theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert s book, the underlying semigroup theory has grown enor- mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com- puter science community, which moved to other concerns. Seller Inventory # LIE9780817637194

More information about this seller | Contact this seller

Buy New
US$ 146.17
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

5.

Howard Straubing
Published by Birkh?user (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Birkh?user, 1994. HRD. Condition: New. New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780817637194

More information about this seller | Contact this seller

Buy New
US$ 143.96
Convert currency

Add to Basket

Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

6.

Howard Straubing
Published by Birkh?user (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Birkh?user, 1994. HRD. Condition: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Seller Inventory # IQ-9780817637194

More information about this seller | Contact this seller

Buy New
US$ 152.41
Convert currency

Add to Basket

Shipping: US$ 11.83
From United Kingdom to U.S.A.
Destination, rates & speeds

7.

HOWARD STRAUBING
Published by BirkhÇÏuser (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description BirkhÇÏuser, 1994. Hardback. Condition: NEW. 9780817637194 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. For all enquiries, please contact Herb Tandree Philosophy Books directly - customer service is our primary goal. Seller Inventory # HTANDREE0285468

More information about this seller | Contact this seller

Buy New
US$ 163.84
Convert currency

Add to Basket

Shipping: US$ 10.49
From United Kingdom to U.S.A.
Destination, rates & speeds

8.

Howard Straubing
Published by BIRKHAUSER BOSTON INC, United States (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 10
Seller:
Book Depository International
(London, United Kingdom)
Rating
[?]

Book Description BIRKHAUSER BOSTON INC, United States, 1994. Hardback. Condition: New. 1994 ed.. Language: English. Brand new Book. The study of the connections between mathematical automata and for- mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first- order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log- ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup- theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor- mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com- puter science community, which moved to other concerns. Seller Inventory # APC9780817637194

More information about this seller | Contact this seller

Buy New
US$ 179.73
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

9.

Howard Straubing
Published by Birkhäuser (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 15
Print on Demand
Seller:
Rating
[?]

Book Description Birkhäuser, 1994. Condition: New. This item is printed on demand for shipment within 3 working days. Seller Inventory # LP9780817637194

More information about this seller | Contact this seller

Buy New
US$ 182.58
Convert currency

Add to Basket

Shipping: US$ 3.21
From Germany to U.S.A.
Destination, rates & speeds

10.

Howard Straubing
Published by BIRKHAUSER BOSTON INC, United States (1994)
ISBN 10: 0817637192 ISBN 13: 9780817637194
New Hardcover Quantity Available: 10
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description BIRKHAUSER BOSTON INC, United States, 1994. Hardback. Condition: New. 1994 ed.. Language: English. Brand new Book. The study of the connections between mathematical automata and for- mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first- order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log- ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960's with the work of J. Richard Biichi on monadic second-order logic. Biichi's investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup- theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert's book, the underlying semigroup theory has grown enor- mously, permitting a considerable extension of their results. During the same period, however, fundamental investigations in the theory of finite automata by and large fell out of fashion in the theoretical com- puter science community, which moved to other concerns. Seller Inventory # APC9780817637194

More information about this seller | Contact this seller

Buy New
US$ 186.24
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

There are more copies of this book

View all search results for this book