iPhoneAlle anzeigen
iPhone 11iPhone 11 ProiPhone 11 Pro MaxiPhone 12iPhone 12 ProiPhone 12 Pro MaxiPhone 12 miniiPhone 13iPhone 13 ProiPhone 13 Pro MaxiPhone 13 miniiPhone 14iPhone 14 PlusiPhone 14 ProiPhone 14 Pro MaxiPhone 15iPhone 15 PlusiPhone 15 ProiPhone 15 Pro MaxiPhone 16iPhone 16 PlusiPhone 16 ProiPhone 16 Pro MaxiPhone 16eiPhone 8iPhone 8 PlusiPhone SE 2020iPhone SE 2022iPhone XiPhone XRiPhone XSiPhone XS Max
Galaxy A-SerieAlle anzeigen
Galaxy A12Galaxy A13Galaxy A13 5GGalaxy A14Galaxy A15Galaxy A16Galaxy A17 5GGalaxy A20eGalaxy A21Galaxy A22Galaxy A23Galaxy A24Galaxy A25Galaxy A26 5GGalaxy A32Galaxy A33Galaxy A34Galaxy A35Galaxy A36 5GGalaxy A40Galaxy A41Galaxy A42Galaxy A50Galaxy A51Galaxy A52Galaxy A53Galaxy A54Galaxy A55Galaxy A56 5GGalaxy A70Galaxy A71Galaxy A72
Redmi SeriesAlle anzeigen
Redmi 10Redmi 13CRedmi 15 5GRedmi Note 10Redmi Note 10 ProRedmi Note 11Redmi Note 11 ProRedmi Note 11 Pro Plus 5GRedmi Note 11sRedmi Note 12Redmi Note 12 5GRedmi Note 12 ProRedmi Note 12 Pro 5GRedmi Note 12 Pro PlusRedmi Note 13Redmi Note 13 5GRedmi Note 13 ProRedmi Note 13 Pro PlusRedmi Note 14Redmi Note 14 Pro PlusRedmi Note 8Redmi Note 8 ProRedmi Note 9Redmi Note 9 Pro
Derzeit nicht verfügbar
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Optischer Zustand
Beschreibung
Theoretical Computer Science — clear, concise, and practical. Theoretical computer science deals with the fundamental questions of computability and the structure of languages. It investigates which problems can be solved algorithmically, which models are needed for that, and what the limits of computation are.
This book guides you step by step through the foundations of formal languages,… computability, and automata theory. You will learn the most important models — from finite automata through pushdown automata and context-free grammars to the Turing machine. You will not only understand the formal constructions, but also the proof techniques used to establish properties of languages and to identify the boundaries of what is computable. Complex concepts such as the Pumping Lemma, the Myhill–Nerode theorem, diagonalization, and Rice’s theorem are explained clearly and intuitively.
Numerous figures, examples, and exercises with worked solutions illustrate the theory and secure learning outcomes. The chapters are modular and pedagogically arranged so you can either pick topics selectively or work through them step by step. Proofs are given in full while intuition and practical relevance are emphasized.
The result is a solid, readable introduction to one of computer science’s central fields — ideal for students, instructors, and anyone who wants not only to understand theoretical computer science but to apply it. Dieses Produkt haben wir gerade leider nicht auf Lager.
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Technische Daten
Erscheinungsdatum
11.12.2025
Sprache
Englisch
EAN
9783565126927
Herausgeber
epubli
Sonderedition
Nein
Autor
Lucien Sina
Seitenanzahl
244
Auflage
2
Einbandart
Broschiert
Lesealter
1-99
Schlagwörter
Theory of Computation, Computational Theory, Computability Theory, Theoretical Computer Science, Automata Theory, Formal Languages, Turing Machines
Thema-Inhalt
UY - Informatik
Höhe
190 mm
Breite
12.5 cm
-.-
★★★★★
☆☆☆☆☆ Leider noch keine Bewertungen
Leider noch keine Bewertungen
Sicher bei rebuy kaufen
Schreib die erste Bewertung für dieses Produkt!
Wenn du eine Bewertung für dieses Produkt schreibst, hilfst du allen Kund:innen, die noch überlegen, ob sie das Produkt kaufen wollen. Vielen Dank, dass du mitmachst!
Sicher bei rebuy kaufen