Labyrinth Problems: Labyrinth-Searching Abilities of Automata: Teubner-Texte zur Mathematik, cartea 114
Cu Armin Hemmerlingde Limba Germană Paperback – 26 noi 2012
Din seria Teubner-Texte zur Mathematik
- Preț: 272.85 lei
- Preț: 243.53 lei
- Preț: 266.92 lei
- Preț: 480.18 lei
- Preț: 246.25 lei
- Preț: 320.40 lei
- Preț: 264.59 lei
- Preț: 264.20 lei
- Preț: 353.02 lei
- 15% Preț: 443.64 lei
- Preț: 354.93 lei
- Preț: 362.65 lei
- Preț: 424.99 lei
- Preț: 360.70 lei
- Preț: 284.82 lei
- Preț: 391.61 lei
- 18% Preț: 900.18 lei
- Preț: 350.50 lei
- Preț: 209.17 lei
Preț: 481.16 lei
Nou
Puncte Express: 722
Preț estimativ în valută:
92.09€ • 94.91$ • 77.75£
92.09€ • 94.91$ • 77.75£
Carte tipărită la comandă
Livrare economică 03-17 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783322945617
ISBN-10: 3322945618
Pagini: 220
Ilustrații: 217 S. 40 Abb.
Greutate: 0.27 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Vieweg+Teubner Verlag
Colecția Vieweg+Teubner Verlag
Seria Teubner-Texte zur Mathematik
Locul publicării:Wiesbaden, Germany
ISBN-10: 3322945618
Pagini: 220
Ilustrații: 217 S. 40 Abb.
Greutate: 0.27 kg
Ediția:Softcover reprint of the original 1st ed. 1989
Editura: Vieweg+Teubner Verlag
Colecția Vieweg+Teubner Verlag
Seria Teubner-Texte zur Mathematik
Locul publicării:Wiesbaden, Germany
Public țintă
Upper undergraduateCuprins
I. Basic Concepts.- 1.1. Graphoids.- 1.2. R-graphoids.- 1.3. C-graphoids.- 1.4. The hierarchy of types of labyrinths.- 1.5. Automata in labyrinths.- 1.6. Normal labyrinth problems and reducibility.- 1.7. Finite automata in corridors.- 1.8. Vertex substitutions.- 1.9. Edge substitutions.- 1.10. Edge insertions.- II. Searching Algorithms.- 2.1. Pidgin Programming Language and Tarry’s algorithm.- 2.2. Face-following and edge-blocking.- 2.3. The bridge-preferring method.- 2.4. Modifications of bridge-preferring.- 2.5. Edge-blocking in normed 2D ficographs.- 2.6. Regular swinging in 20 ficographs.- 2.7. Searching by means of space-bounded Turing tapes.- 2.8. Searching all infinite connected 2D graphs.- III. Trap Constructions.- 3.1. Plane R-traps for finite automata and related types.- 3.2. Traps for halting automata.- 3.3. 2D traps for finite automata.- 3.4. Corollaries about 2D traps.- 3.5. Universal traps.- 3.6. Plane R-traps for plenary multihead automata.- 3.7. Barrages and traps for cooperating systems.- IV. Supplements and Problems.- 4.1. Automata without markers in finite labyrinths.- 4.2. Marker automata and cooperating systems in finite labyrinths.- 4.3. Automata in infinite labyrinths.- 4.4. On some other results and problems.- L. Labyrinth theory.- S. Surroundings.- Q. Quotations.- Theorems, corollaries, propositions, lemmas, programs supplements, problems, figures.- Definitions.- Symbols introduced within the text.- Some predefined symbols.