Labyrinth Problems
49,95 €
versandkostenfrei*

inkl. MwSt.
Sofort lieferbar
0 °P sammeln
    Broschiertes Buch

Produktdetails
  • Teubner-Texte zur Mathematik 114
  • Verlag: Vieweg+Teubner / Vieweg+Teubner Verlag
  • Softcover reprint of the original 1st ed. 1989
  • Seitenzahl: 220
  • Erscheinungstermin: 26. November 2012
  • Deutsch
  • Abmessung: 210mm x 148mm x 12mm
  • Gewicht: 293g
  • ISBN-13: 9783322945617
  • ISBN-10: 3322945618
  • Artikelnr.: 39174259
Inhaltsangabe
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