Labyrinth Problems Labyrinth Searching Abilities (7 results)
Language: German
Published by Labyrinth Problems: Labyrinth-Searching Abilities of Automata, Teubner-Texte 1989
- Softcover
Seller: BUCHSERVICE / ANTIQUARIAT Lars Lutzer, Wahlstedt, GermanyBUCHSERVICE / ANTIQUARIAT Lars Lutzer
Contact seller5-star sellerCondition: Used - Very good
US$ 23.58
US$ 45.84 shippingShips from Germany to U.S.A.Quantity: 1 available
Softcover. Condition: gut. Labyrinth Problems: Labyrinth-Searching Abilities of Automata, Teubner-Texte In deutscher Sprache. pages.
- Softcover
Seller: Chiron Media, Wallingford, , United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 62.07
US$ 20.50 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
Language: German
Published by Vieweg+Teubner Verlag, Vieweg+Teubner Verlag 2012
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 59.04
US$ 70.53 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 s…ubstitutions.- 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.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 66.43
US$ 15.85 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
More images- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
US$ 59.04
US$ 80.33 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. Labyrinth Problems | Labyrinth-Searching Abilities of Automata | Armin Hemmerling | Taschenbuch | 217 S. | Deutsch | 2012 | Vieweg & Teubner | EAN 9783322945617 | Verantwortliche Person für die EU: Springer Vieweg in Springer Science + Business Media, Abraham-Lincoln-Str. 46, 65189 Wiesbaden, juergen…[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
- Softcover
Seller: Buchpark, Trebbin, , GermanyBuchpark
Contact seller5-star sellerCondition: Used
US$ 55.33
US$ 120.49 shippingShips from Germany to U.S.A.Quantity: 1 available
Condition: Hervorragend. Zustand: Hervorragend | Sprache: Deutsch | Produktart: Bücher | 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. V…ertex 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.
- Softcover
Seller: Mispah books, Redhill, SURRE, United KingdomMispah books
Contact seller4-star sellerCondition: Used - As new
US$ 109.03
US$ 33.08 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: Like New. Like New. book.
