Matches in SemOpenAlex for { <https://semopenalex.org/work/W2796973897> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2796973897 abstract "In this paper we introduce and investigate a new type of automata which turns out to be rich in deep and complex phenomena. For our model, a maze is a countable strongly connected digraph called the board together with a proper colouring of its edges (the edges leaving a vertex have distinct colours) and two special vertices: the origin and the destination. A pointer or robot starts at the origin of a maze and moves naturally between its vertices, according to a finite or infinite sequence of specific instructions from the set of all colours called an algorithm; if the robot is at a vertex for which there is no out-edge of the colour indicated by the instruction, it remains at that vertex and proceeds to execute the next instruction in the sequence. The central object of study is the existence of algorithms that simultaneously solve, that is guide the robot to visit the destination in, certain large sets of mazes. One of the most natural and interesting sets of mazes arises from the square lattice $Z^2$ viewed as a graph with arbitrarily many edges removed (each edge corresponds to a pair of opposite directed edges), together with the suggestive colouring that assigns to each directed edge the corresponding cardinal direction. In this set-up, a research question of Leader and Spink from 2011, which proved to be very profound, asks whether there exists an algorithm which solves this set of mazes. In this paper we make progress towards this question. We consider the subset of all such mazes which have arbitrarily many horizontal edges removed but only finitely many vertical edges removed in consecutive columns, and construct an algorithm which solves this subset of mazes." @default.
- W2796973897 created "2018-04-24" @default.
- W2796973897 creator A5060652512 @default.
- W2796973897 creator A5086003488 @default.
- W2796973897 date "2018-04-15" @default.
- W2796973897 modified "2023-09-27" @default.
- W2796973897 title "Solvability of Mazes by Blind Robots" @default.
- W2796973897 cites W1848705440 @default.
- W2796973897 cites W1963809293 @default.
- W2796973897 cites W2008903685 @default.
- W2796973897 cites W2015970678 @default.
- W2796973897 cites W2020071688 @default.
- W2796973897 cites W2067312148 @default.
- W2796973897 cites W2078426390 @default.
- W2796973897 cites W2122803069 @default.
- W2796973897 cites W2962940319 @default.
- W2796973897 cites W2547769506 @default.
- W2796973897 hasPublicationYear "2018" @default.
- W2796973897 type Work @default.
- W2796973897 sameAs 2796973897 @default.
- W2796973897 citedByCount "1" @default.
- W2796973897 countsByYear W27969738972018 @default.
- W2796973897 crossrefType "posted-content" @default.
- W2796973897 hasAuthorship W2796973897A5060652512 @default.
- W2796973897 hasAuthorship W2796973897A5086003488 @default.
- W2796973897 hasConcept C110729354 @default.
- W2796973897 hasConcept C11413529 @default.
- W2796973897 hasConcept C114614502 @default.
- W2796973897 hasConcept C118615104 @default.
- W2796973897 hasConcept C132525143 @default.
- W2796973897 hasConcept C150202949 @default.
- W2796973897 hasConcept C154945302 @default.
- W2796973897 hasConcept C2778112365 @default.
- W2796973897 hasConcept C2779145032 @default.
- W2796973897 hasConcept C33923547 @default.
- W2796973897 hasConcept C41008148 @default.
- W2796973897 hasConcept C54355233 @default.
- W2796973897 hasConcept C80899671 @default.
- W2796973897 hasConcept C86803240 @default.
- W2796973897 hasConcept C90509273 @default.
- W2796973897 hasConceptScore W2796973897C110729354 @default.
- W2796973897 hasConceptScore W2796973897C11413529 @default.
- W2796973897 hasConceptScore W2796973897C114614502 @default.
- W2796973897 hasConceptScore W2796973897C118615104 @default.
- W2796973897 hasConceptScore W2796973897C132525143 @default.
- W2796973897 hasConceptScore W2796973897C150202949 @default.
- W2796973897 hasConceptScore W2796973897C154945302 @default.
- W2796973897 hasConceptScore W2796973897C2778112365 @default.
- W2796973897 hasConceptScore W2796973897C2779145032 @default.
- W2796973897 hasConceptScore W2796973897C33923547 @default.
- W2796973897 hasConceptScore W2796973897C41008148 @default.
- W2796973897 hasConceptScore W2796973897C54355233 @default.
- W2796973897 hasConceptScore W2796973897C80899671 @default.
- W2796973897 hasConceptScore W2796973897C86803240 @default.
- W2796973897 hasConceptScore W2796973897C90509273 @default.
- W2796973897 hasLocation W27969738971 @default.
- W2796973897 hasOpenAccess W2796973897 @default.
- W2796973897 hasPrimaryLocation W27969738971 @default.
- W2796973897 hasRelatedWork W111020236 @default.
- W2796973897 hasRelatedWork W1497663933 @default.
- W2796973897 hasRelatedWork W1970845672 @default.
- W2796973897 hasRelatedWork W2048209083 @default.
- W2796973897 hasRelatedWork W2077944048 @default.
- W2796973897 hasRelatedWork W2119521284 @default.
- W2796973897 hasRelatedWork W2135737379 @default.
- W2796973897 hasRelatedWork W2149888497 @default.
- W2796973897 hasRelatedWork W2281692433 @default.
- W2796973897 hasRelatedWork W231298231 @default.
- W2796973897 hasRelatedWork W2511879291 @default.
- W2796973897 hasRelatedWork W2540712692 @default.
- W2796973897 hasRelatedWork W2549027944 @default.
- W2796973897 hasRelatedWork W2588876993 @default.
- W2796973897 hasRelatedWork W2937427272 @default.
- W2796973897 hasRelatedWork W2950140953 @default.
- W2796973897 hasRelatedWork W2950774858 @default.
- W2796973897 hasRelatedWork W3002565821 @default.
- W2796973897 hasRelatedWork W3104596862 @default.
- W2796973897 hasRelatedWork W745634171 @default.
- W2796973897 isParatext "false" @default.
- W2796973897 isRetracted "false" @default.
- W2796973897 magId "2796973897" @default.
- W2796973897 workType "article" @default.