Importo totale (1 articolo articoli):
Destinazione ordine:
straubing howard (40 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (40)
- Riviste e Giornali (Nessun altro risultato corrispondente a questo perfezionamento)
- Fumetti (Nessun altro risultato corrispondente a questo perfezionamento)
- Spartiti (Nessun altro risultato corrispondente a questo perfezionamento)
- Arte, Stampe e Poster (Nessun altro risultato corrispondente a questo perfezionamento)
- Fotografie (Nessun altro risultato corrispondente a questo perfezionamento)
- Mappe (Nessun altro risultato corrispondente a questo perfezionamento)
- Manoscritti e Collezionismo cartaceo (Nessun altro risultato corrispondente a questo perfezionamento)
Condizioni Maggiori informazioni
- Nuovo (34)
- Come nuovo, Ottimo o Quasi ottimo (3)
- Molto buono o Buono (3)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
Ulteriori caratteristiche
- Prima ed. (Nessun altro risultato corrispondente a questo perfezionamento)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (18)
- Non Print on Demand (28)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 93,86
Spedizione EUR 2,32
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: BennettBooksLtd, Los Angeles, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: New. In shrink wrap. Looks like an interesting title!
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: PBShop.store UK, Fairford, GLOS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 94,97
Spedizione EUR 4,82
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: PBShop.store US, Wood Dale, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
HRD. Condizione: New. New Book. Shipped from UK. Established seller since 2000.
-
EUR 38,57
Spedizione EUR 62,30
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrellohardcover. Condizione: Gut. 239 Seiten; 9780817637194.3 Gewicht in Gramm: 2.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 95,38
Spedizione EUR 12,33
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
EUR 109,82
Spedizione EUR 2,32
Spedito in U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 94,96
Spedizione EUR 17,38
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 111,06
Spedizione EUR 17,38
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: As New. Unread book in perfect condition.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 115,62
Spedizione EUR 13,88
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 115,62
Spedizione EUR 13,88
Spedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
-
Finite Automata, Formal Logic, and Circuit Complexity
Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Mai 1994, 1994
ISBN 10: 0817637192 ISBN 13: 9780817637194
EUR 106,99
Spedizione EUR 25,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware -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.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 120,45
Spedizione EUR 18,76
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardback. Condizione: New. New copy - Usually dispatched within 4 working days.
-
EUR 92,27
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 133,78
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 1994. 1994th Edition. hardcover. . . . . .
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 240.
-
EUR 101,04
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Valutazione del venditore 5 su 5 stelle
EUR 140,35
Spedizione EUR 10,50
Spedito da Irlanda a U.S.A.Quantità: 15 disponibili
Aggiungi al carrelloCondizione: New. 2012. Paperback. . . . . .
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 240.
-
EUR 93,80
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Finite Automata, Formal Logic, and Circuit Complexity | Howard Straubing | Buch | Progress in Theoretical Computer Science | xii | Englisch | 1994 | Birkhäuser | EAN 9780817637194 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 1994. 1994th Edition. hardcover. . . . . . Books ship from the US and Ireland.
-
EUR 104,15
Spedizione EUR 70,00
Spedito da Germania a U.S.A.Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Finite Automata, Formal Logic, and Circuit Complexity | Howard Straubing | Taschenbuch | Progress in Theoretical Computer Science | xii | Englisch | 2012 | Birkhäuser | EAN 9781461266952 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
-
EUR 112,18
Spedizione EUR 62,64
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Finite Automata, Formal Logic, and Circuit Complexity
Da: Kennys Bookstore, Olney, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
-
EUR 123,65
Spedizione EUR 61,86
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 186,17
Spedizione EUR 28,97
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Like New. Like New. book.
-
Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) Howard Straubing
Da: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, Germania
Valutazione del venditore 5 su 5 stelle
EUR 189,90
Spedizione EUR 39,95
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: gut. 1994. Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) In deutscher Sprache. pages.
-
Finite Automata, Formal Logic, and Circuit Complexity
Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Mai 1994, 1994
ISBN 10: 0817637192 ISBN 13: 9780817637194
Da: Books-by-Floh, Paderborn, Germania
Valutazione del venditore 4 su 5 stelle
EUR 139,24
Spedizione EUR 105,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Neuware -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. 240 pp. Englisch.
-
Finite Automata, Formal Logic, and Circuit Complexity (eng)
Da: Brook Bookstore On Demand, Napoli, NA, Italia
Valutazione del venditore 5 su 5 stelle
EUR 94,25
Spedizione EUR 5,50
Spedito da Italia a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: new. Questo è un articolo print on demand.
-
Finite Automata, Formal Logic, and Circuit Complexity
Lingua: Inglese
Editore: Birkhäuser, Birkhäuser Mai 1994, 1994
ISBN 10: 0817637192 ISBN 13: 9780817637194
Da: Rheinberg-Buch Andreas Meier eK, Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 106,99
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 240 pp. Englisch.
