Importo totale (1 articolo articoli):
Destinazione ordine:
9780387949079 - Automata and Computability di Kozen, Dexter C. (21 risultati)
Vai alla pagina principale dei risultati di ricerca
Filtri di ricerca
Tipo di articolo
- Tutti i tipi di prodotto
- Libri (21)
- 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 (14)
- Come nuovo, Ottimo o Quasi ottimo (2)
- Molto buono o Buono (5)
- Discreto o Mediocre (Nessun altro risultato corrispondente a questo perfezionamento)
- Come descritto (Nessun altro risultato corrispondente a questo perfezionamento)
Legatura
- Tutte
- Rilegato (21)
- Brossura (Nessun altro risultato corrispondente a questo perfezionamento)
Ulteriori caratteristiche
- Prima ed. (1)
- Copia autograf. (Nessun altro risultato corrispondente a questo perfezionamento)
- Sovracoperta (Nessun altro risultato corrispondente a questo perfezionamento)
- Con foto (7)
- Non Print on Demand (16)
Lingua (1)
Spedizione gratuita
Paese del venditore
Valutazione venditore
-
Automata and Computability
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Automata and Computability (Undergraduate Texts in Computer Science)
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.
-
Automata and Computability (Undergraduate Texts in Computer Science)
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Good. Item in good condition and has highlighting/writing on text. Used texts may not contain supplemental items such as CDs, info-trac etc.
-
Automata and Computability
Da: Better World Books Ltd, Dunfermline, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 19,82
Spedizione EUR 5,78
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
-
Hardcover. Condizione: new. New Copy. Customer Service Guaranteed.
-
Condizione: Very Good.
-
Automata and Computability
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New.
-
Condizione: New.
-
Automata and Computability (Undergraduate Texts in 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!
-
Condizione: New. Satisfaction Guaranteed or your money back.
-
Automata and Computability (Hardcover)
Lingua: Inglese
Editore: Springer-Verlag New York Inc., New York, NY, 1997
ISBN 10: 0387949070 ISBN 13: 9780387949079
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Prima edizione
Hardcover. Condizione: new. Hardcover. The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Godel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Automata and Computability
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 424.
-
Automata and Computability (Undergraduate Texts in Computer Science)
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
EUR 131,82
Spedizione EUR 14,45
Spedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. 400 pages. 9.75x7.50x1.25 inches. In Stock.
-
EUR 92,26
Spedizione EUR 64,92
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.
-
Automata and Computability (Undergraduate Texts in Computer Science)
Da: Mispah books, Redhill, SURRE, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 140,49
Spedizione EUR 28,90
Spedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
-
Automata and Computability
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition.
-
Automata and Computability
Lingua: Inglese
Editore: Springer, Springer Apr 1997, 1997
ISBN 10: 0387949070 ISBN 13: 9780387949079
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
EUR 85,59
Spedizione EUR 23,00
Spedito da Germania a U.S.A.Quantità: 2 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science. 420 pp. Englisch.
-
EUR 72,89
Spedizione EUR 48,99
Spedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduction to the basic theoretical models of computability, providing students who have already some experience with elementary discrete mathematics with a well-paced first courseA number of supplementary chapters introduce more advanced concep.
-
Automata and Computability
Da: Majestic Books, Hounslow, Regno Unito
Valutazione del venditore 4 su 5 stelle
EUR 125,28
Spedizione EUR 7,51
Spedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 424 68:B&W 7 x 10 in or 254 x 178 mm Case Laminate on White w/Gloss Lam This item is printed on demand.
-
Automata and Computability
Da: Biblios, Frankfurt am main, HESSE, Germania
Valutazione del venditore 4 su 5 stelle
EUR 127,62
Spedizione EUR 9,95
Spedito da Germania a U.S.A.Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 424.
-
Automata and Computability
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
EUR 85,59
Spedizione EUR 60,00
Spedito da Germania a U.S.A.Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. The first part of the book is devoted to finite automata and their properties. Then, material on pushdown automata provides a broader class of models and enables the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 420 pp. Englisch.
