Silas Haslam, A General History of Labyrinths. Vienna, 1888. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
.... con rm its existence, but for any DFA (or even DPDA) there is a maze it will get lost in and loop forever [8] this is an open question if the DFA can move through walls) The keep your hand on the right hand wall method, for instance, will fail if the maze has a loop with a outside and b inside [21]. We will use this as a canonical NFA problem to discuss the computational complexity of NFA languages in Section 2.8 below. 2.5 Homomorphisms of LLL s, or h(LLL) s We now come to our most subtle class of 2 d languages. De nition. Suppose L is a 2 d language over an alphabet A. Then we say L is ....
Silas Haslam, A General History of Labyrinths. Vienna, 1888.
Order Parameter Equations for Front Transitions: Nonuniformly .. - Hagberg, Meron (1998) (1 citation) (Correct)
....depend to a large extent on the possible occurrence of interfacial instabilities. A transverse instability 1 aric lanl.gov 2 ehud bgumail.bgu.ac. il Preprint submitted to Elsevier Preprint 29 July of the interface, for example, may lead to fingering and the formation of labyrinthine patterns [2 8]. Another instability with dramatic effects on pattern formation is the nonequilibrium Ising Bloch (NIB) bifurcation [9 13] The bifurcation, which takes a single stable (Ising) front to a pair of counterpropagating stable (Bloch) fronts, has been found in chemical reactions [14 16] and in ....
S. Haslam, A General History of Labyrinths (Vienna, 1888).
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
.... its existence, but for any DFA (or even DPDA) there is a maze it will get lost in and loop forever [8] this is an open question if the DFA can move through walls) The keep your hand on the right hand wall method, for instance, will fail if the maze has a loop with a outside and b inside [18]. We will use this as a canonical NFA problem to discuss the computational complexity of NFA languages in Section 2.8 below. 2.5 Homomorphisms of LLL s, or h(LLL) s We now come to our most subtle class of 2 d languages. Definition. Suppose L is a 2 d language over an alphabet A. Then we say L ....
Silas Haslam, A General History of Labyrinths. Vienna, 1888.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC