Reconstructing a random scenery in polynomial time
|
|
- Bathsheba Shepherd
- 5 years ago
- Views:
Transcription
1 Reconstructing a random scenery in polynomial time Citation for published version (AA): Matzinger, H., & Rolles, S. W. W. (). Reconstructing a random scenery in polynomial time. (Report Eurandom Vol. 1). Eindhoven: Technische Universiteit Eindhoven. Document status and date: ublished: 1/1/ Document Version: ublisher s DF, also known as Version of Record (includes final page, issue and volume numbers) lease check the document version of this publication: A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. eople interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. The final author version and the galley proof are versions of the publication after peer review. The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal. If the publication is distributed under the terms of Article 5fa of the Dutch Copyright Act, indicated by the Taverne license above, please follow below link for the End User Agreement: Take down policy If you believe that this document breaches copyright please contact us at: openaccess@tue.nl providing details and we will investigate your claim. Download date: 11. Mar. 19
2 Reconstructing a random scenery in polynomial time Heinrich Matzinger Silke W.W. Rolles y March 1, Abstract Benjamini asked whether the scenery reconstruction problem can be solved in polynomial time. In this article, we answer his question in the armative for an i.i.d. uniformly colored scenery on Z observed along a random walk path with bounded jumps. We assume the random walk is recurrent, can reach every integer with positive probability, and the number of possible single steps for the random walk exceeds the number of colors. We prove that a nite piece of scenery of length l around the origin can be reconstructed up to reection and a small translation from the rst p(l) observations with high probability here p is a polynomial and the probability that the reconstruction succeeds converges to 1 as l! Introduction and Result We call a coloring of Z with colors from the nite set C := f1 ::: Cg a scenery. The scenery reconstruction problem can be described as follows: Let be a scenery and let S := (S k k N ) be a recurrent random walk on Z. If we are given the color record := ((S k ) k N ) observed along the random walk path, can we almost surely reconstruct from these observations (of course without knowing S)? It is not hard to see that in general the reconstruction works only up to a reection and translation. Recently, Lindenstrauss [7] proved the existence of uncountably many sceneries which cannot be reconstructed. Nevertheless it turns out that in many situations typical" sceneries can be reconstructed if the scenery is randomly colored and the random walk S is independent of. Work on the scenery reconstruction problem started with the question how much information can be extracted from the color record. This question was Eurandom, O Box 513, 5 MB Eindhoven, The Netherlands. Matzinger@eurandom.tue.nl y Eurandom, O Box 513, 5 MB Eindhoven, The Netherlands. Rolles@eurandom.tue.nl 1 Keywords: Scenery reconstruction, random walk, polynomial time 1
3 addressed in the 8s by Benjamini and independently by den Hollander and Keane (see []). Kesten [5] proved that a single defect in a 4-color random scenery can be detected if the scenery is i.i.d. uniformly colored. In his h.d. thesis [11] (see also [1] and [13]) Matzinger studied the scenery reconstruction problem for i.i.d. uniformly colored -color sceneries. He showed that almost all sceneries can be almost surely reconstructed up to equivalence if they are observed along a simple random walk path (with holding) here we call two sceneries and equivalent,, if can be obtained from by a reection and/or a translation. After Kesten had noticed that Matzinger's proof relies heavily on the skip-freeness of the random walk, Lowe, Matzinger, and Merkl [1]proved that scenery reconstruction still works if the random walk has i.i.d. increments with nite support. More precisely they made the following assumptions: The scenery on Z is i.i.d. uniformly colored with colors from the set C. The random walk is independent of the scenery, has i.i.d. increments with nite support, is recurrent, and can reach every integer with positive probability. They require that there is at least one color more than possible jumps for the random walk. Under these assumptions it is proved in [1] that almost all sceneries can be almost surely reconstructed up to equivalence. In this article, we rene the reconstruction result of Lowe, Matzinger, and Merkl. We make the same assumptions on scenery and random walk as in [1] with the only exception that we assume that the maximal jump lengths to the left and to the right of the random walk are equal. This additional assumption is made to keep the exposition as easy as possible. We believe that our result is true without this assumption. Below weprove that for n large a nite piece of scenery of length l(n) =1 n + 1 around the origin can be reconstructed with high probability from the rst n 7 + 1n observations with a constant > thus the number of observations needed is polynomial in l(n). In order to state our main result we need some notation. All intervals are taken over the integers, e.g. [a b] :=fx Z : a x bg. We write fjd for the restriction of a function f to a set D. For two words w C [ m] and w C [ m ] with m m we write w 4 w if there exists an interval I [ m ] such that the restriction of w to I can be obtained from w by a reection and/or a translation. We set for n N n 1 := bp n c n := bp n 1c (1) here bxc denotes the largest integer x. The dependence of n on n is always suppressed wealways write n instead of using the more precise notation n (n ). Formally, our result reads as follows: N there Theorem 1 There exists > such that for innitely many n exists a map A n : [ C[ n +n7 +1n!C [5n 5 n ] which is measurable with respect to the -algebras generated by the canonical projections such that for the events j[ n E n j [1 n 1 n ] ini works := j n1 n1 4 A n + n 7 + 1n [ 4
4 the following holds: lim n!1 (En ini works )=1: The algorithm A n gets as input the rst n +n 7 + 1n observations of the random walker and produces an output of length 1 n +1. If the reconstruction is successful in the sense that the event E n ini works holds, then the output of A n is a piece of the scenery which istypically not centered around the origin. The output is a piece of scenery which is up to equivalence contained in [1 n 1 n ]. Note that it is essential to reconstruct a nite piece of scenery close to the origin because the scenery is i.i.d. uniformly colored and therefore any nite color pattern can be almost surely found somewhere in the scenery. In [14], the authors study the scenery reconstruction problem under the same assumptions as in this article and prove that almost all sceneries can be almost surely reconstructed up to equivalence if there are some errors in the observations. Scenery reconstruction results in dierent settings have e.g. been obtained by Lowe andmatzinger in [9] and [8]. Related work on the scenery distinguishing problem has been done by Benjamini and Kesten [1] and Howard in [4] and [3]. The remainder of this article is organized as follows: In Section, we formally dene our setting. In Section 3, we review a result from [1]. Section 4 contains the denition of the reconstruction algorithm A n. Section 5 contains some lemmas. In Section, we prove Theorem 1. Setting Let C. We assume that the scenery := ( k k Z) isi.i.d. uniformly distributed over C := f1 ::: Cg. Let be a probability measure over Z with nite support M and let S := (S k k N ) be a random walk on Z with -distributed increments, independent of. We assume jmj < jcj, i.e. there is at least one color more than possible steps for the random walk. Furthermore we assume that M has greatest common divisor 1 and km k(k) = thus S can reach every integer with positive probability and is recurrent. To keep the notation simple we require max M = j min Mj, i.e. the maximal jump lengths to the left and to the right agree. We denote the maximal jump length by L. Let Z N be the set of all paths with jump sizes S k+1 S k Mfor all k N. We realize ( S) as canonical projections on the probability space := C Z := Z Q with the product -algebra generated by the canonical projections here denotes the uniform distribution on the set of colors C and Q the distribution of the random walk starting at the origin. We write := ( k := (S k ) k N ) for the observations of the scenery along the random walk path. 3
5 We dene the shift :! by ( S) 7! (( + S(1)) S( +1) S(1)) : Intuitively, shifts the origin to the position of the random walker at time 1. All constants keep there meaning throughout the article. 3 Review of a Result of Lowe, Matzinger, and Merkl Lowe, Matzinger, and Merkl [1] showed the existence of measurable maps A n which do partial reconstructions". In order to dene the reconstruction algorithm A n,we use these partial algorithms. The maps An reconstruct with high probability a large piece of scenery around the origin if the observations start with a suciently large block ofones. More formally: We dene the event thata n reconstructs correctly a piece of scenery around the origin: E n recon := j[ n n ] 4 A n j[ 1n [ 4 j[9 n 9 n ] here = (jcj ) is a suciently large positive constant independent of n. For n N, we denote by E B (n) theevent that the rst n + 1 observations are all equal to 1: E B (n) :=f k = 1 for all k [ n]g: For an interval J Z, we write (1) J for the piece of scenery in C J which is constantly equal to 1. We dene the event that there is a long block ofones close to the origin": BigBlock := There exists an integer interval J Ln Ln with jj jn 4 such thatjj =(1) J We denote by B the image of the conditional distribution (je B (n )) under the shift n, and we abbreviate ~ := B (jbigblock). We set " 1 (n ):= B ([E n recon] c ) () i.e. " 1 (n ) is the probability thata n does not fulll its task, and we observe B ([E n recon] c ) B ([E n recon] c BigBlock)+ B ([BigBlock] c ) ~ ([E n recon] c )+ B ([BigBlock] c ) : (3) In [1], Lowe, Matzinger, and Merkl prove lim n!1 ~ ([Erecon] n c ) =. The second term on the right-hand side of (3) converges to as n!1by Lemma 3.3 in [1]. Hence it follows from () and (3) that lim " 1(n )=: (4) n!1 : 4
6 4 The Algorithm A n In general it will not take too long" until a long block ofonesisobserved in the observations we then apply A n to the observations collected right after this long block ofones. Formally we let for k N, Z k be the Bernoulli random variable taking values in f 1g which is equal to one if and only if (kn + j) = 1 for all j [ n ]. We set k := min fk :Z k =1g : (5) +n7 +1n [! C [5n 5 n ] as fol- Denition We dene A n : C [ n lows: If k n,thenwedenea n j[ n + n 7 + 1n [ := A n j[ kn + n kn + n + 1n [ : j[ n + n 7 + 1n [ := (1) [5 n 5 n ], i.e. Otherwise we dene A n the output equals the piece ofscenery which is constantly equal to 1. In the remainder of the article we will prove that A n specied by Theorem 1. 5 Some Lemmas For k N we dene the events E n k := ( k1 i= E n k := S in Note that E n k = f k kg. Z i = ) S kn > Ln for all i<k : fullls its task Lemma 3 For n N,letF(n) be the-algebra generated by the whole scenery and the random walk up to time n: F(n) :=( S(i) i [ n]). There existsa constant c 3 > such that for all n N and all k n h E n k i c F n (k 1) + n c3 n n : roof. By the local central limit theorem (see e.g. [], Theorem (5.), page 13), the probability that the random walk after n n steps hits a set containing at most 4Ln +1 n points is bounded by c 4 n 3 4Ln n = c3 n n here c 4 > is a constant independent ofn and c 3 =4Lc 4. The claim follows. The next lemma gives information about the tail probability of k. We need some notation: For k N,let F (k) denote the tail probability: F (k) := k>k : () 5
7 We set " (n ) := s max 1 " 1 (n ) (7) n k n := min k : F (k) " (n ) : (8) Lemma 4 There exists c 5 such that k n n for all n c 5. roof. For k N,we dene the Bernoulli random variable Zk which is equal to 1 if and only if Z k =1orE n k does not hold. We have that ( n k= Z k > ) n k= E n k k n thus n F (n )= k>n k= h i c E n k + ( n k= Z k = )! : (9) By Lemma 3, n k= h i c E n k (n +1)c 3 n n : (1). The sequence ( Zk k ) is adapted to the ltra- We dene the -algebra G k := Z i S(in ) S(jn ) (S(in )+z) i<j k +1 z Ln Ln tion (G k k ). Furthermore, by the denition of Zk, ( Zk =1jG k1 ) = 1E n k (Z k =1jG k1 )+1 1E n k E B (n ) h i c E n k here 1A denotes the indicator function of the set A. For the rst equality we used E n k G k1. For the last inequality we used that Z k is measurable with respect to (S(kn )+z) z Ln Ln which is independent of G k1. We abbreviate p n := E B (n ). The preceding estimate yields n k= Z k =! = E = " 1 ( n k= "( n1 k= (1 p n ) Z k = Z k = ( n1 k= ) ) n k= Z k = n k= ) E n k E n k n 1 k= #! Zn = # Gn1! E n k
8 here E denotes the expectation with respect to. Using an induction argument, we conclude n k= Z k =! (1 p n ) n : (11) In order to obtain a lower bound for p n, rst note (z) =18z n 11 n11 =(1=C) n Furthermore, by Doob's inequality (see e.g. [], page 5), max js(i)j >n 11 i[ n ] n Var(S(n )) = c n with some constant c >. Thus, we obtain for all n suciently large p n = E B (n ) (z) =18z n 11 n11 max js(i)jn 11 i[ n ] C n11 1 (1 c n ) Cn11 : (1) It follows from (11) and (1) that n k= Z k =! 1 C n11 n exp n C n11 : Using the denition of n (1), we see that the right-hand side is bounded above by 1 n 1= for all n suciently large. Combining this with (9) and (1) yields for all n suciently large F (n ) (n +1)c 3 n n + 1 n 1= n 1= " (n ) for the last inequality we used the denition of " (n ) (7). The claim follows from the denition of k n. We dene E n := S in 4 S kn 4 > Ln E n := k k n E n : Lemma 5 The following holds: roof. We observe that lim n!1 ([En ]c )=: for all i< k ([E n ]c ) = k>kn + k k n E n c : 7
9 By the denition of F and kn, k>kn = F (kn ) " (n ), which convergestoasn!1 recall the denition of " (n )and(4). Using Lemmas 3 and 4, we obtain for all n suciently large k k n k E n c n i= h i c E n i c3 n n (n +1) which convergestoasn!1by the denition of n (1). The claim follows. roof of Theorem 1 roof of Theorem 1. The following holds: ([E n ini works ]c ) ([E n ini works ]c E n )+ ([En ]c ) : By Lemma 5, the second term on the right-hand side converges to as n!1. It suces to prove that the same is true for the rst term. We observe that ([E n ini works ]c E n )= kn k= By the denition of the shift, we have form [E n ini works ]c E n j k = k k = k m ( S) =( ( + S (m)) S( + m) S (m)) : Consequently, we obtain for n suciently large and k k n kn n (E n recon) k = k E n ini works k = k (13) here we used that if k = k, then the rst observation which A n uses is kn + n and for all n suciently large, L n1 S kn + n kn + n L k n n + n L n 7 + n because the random walker starts at the origin and jumps in each step at most a distance of L. Hence the reconstruction starts not at the origin, but at position S kn + n which has a distance n 1 from the origin. This is why dierent pieces of scenery of are concerned in the denitions of Erecon n and. Thus (13) yields E n ini works ([E n ini works ]c E n ) (14) k n k= k n k= h kn n (E n recon) h kn n (E n recon) 8 i c n E k = k i c f k = kge n k = k k = k : (15)
10 Note that E n k = f k kg and E n k = E n fk = kg. Consequently, for k k n, f k = kge n =kn (E B (n )) E n k E n k : (1) By the Markov property, we know that S t + kn S kn t is independent of S(t) t [ kn ]. The event kn (EB (n )) depends only on S t + kn S kn t and S(kn )+z z Ln Ln because the random walker can jump in each step at most a distance of L. On the other hand, wehavethate n k E n k only depends on S(t) t kn and the scenery S(kn )+z z Ln. Since the scenery is Ln i.i.d., the event kn (EB (n )) is independent ofe n k E n k. For any events A B C with the property thata and B are independent and (B) > the following inequality holds: (CjA B) (CjA) (B) : In our case this yields together with (1): = = i h kn n c (E recon) n fk = kge n i h kn n c (E recon) n kn (E B (n )) E n k h c kn n (E n recon)i kn (EB (n )) h n (E n E n k E n k c recon)i EB (n ) E n k E n k = E n k (17) E n k E n k " 1 (n ) (18) for the second but last inequality we used that the shift preserves the measure by Lemma 4.1 of [1] for the last equality we used denition (). Using the monotonicity of F and the denition of kn,we obtain for all k k n E n k = k k = F (k 1) F (kn 1) " (n ) : Combinig the last inequality with Lemma 3 and the fact E n k F(t) for t = n (k 1) + n,we obtain h h E n k ii E n k F(t) i 1 c 3 n n he n k 1 c 3 n n " (n ) : For n big enough we get that 1 c 3 n n > 1=. In that case we conclude E n k E n k " (n ) =: 9
11 Combining the last estimate with (18), we obtain h kn (E n recon) i c f k = kge n " 1 (n ) " (n ) : By the denition of " (n )(7),wehave " (n ) p " 1 (n ). Thus, Using (15) we get h kn (E n recon) i c f k = kge n ([E n ini works ]c E n ) p " 1 (n ): p " 1 (n ): It follows from (4) that lim n!1 ([E n ini works ]c E n )=. This completes the proof of Theorem 1. References [1] I. Benjamini and H. Kesten. Distinguishing sceneries by observing the scenery along a random walk path. J. Anal. Math., 9:97{135, 199. [] R. Durrett. robability: Theory and Examples. Duxbury ress, Second edition, 199. [3] C. D. Howard. Orthogonality of measures induced by random walks with scenery. Combin. robab. Comput., 5(3):47{5, 199. [4] C. D. Howard. Distinguishing certain random sceneries on Z via random walks. Statist. robab. Lett., 34():13{13, [5] H. Kesten. Detecting a single defect in a scenery by observing the scenery along a random walk path. In It^o's stochastic calculus and probability theory, pages 171{183. Springer, Tyo, 199. [] H. Kesten. Distinguishing and reconstructing sceneries from observations along random walk paths. In Microsurveys in discrete probability (rinceton, NJ, 1997), pages 75{83. Amer. Math. Soc., rovidence, RI, [7] E. Lindenstrauss. Indistinguishable sceneries. Random Structures Algorithms, 14(1):71{8, [8] M. Lowe and H. Matzinger. Reconstruction of sceneries with correlated colors. Eurandom Report 99-3, [9] M. Lowe and H. Matzinger. Scenery reconstruction in two dimensions with many colors. Eurandom Report 99-18, [1] M. Lowe, H. Matzinger, and F. Merkl. Reconstructing a multicolor random scenery seen along a random walk path with bounded jumps. Eurandom Report 1-3, 1. 1
12 [11] H. Matzinger. Reconstructing a -color scenery by observing it along a simple random walk path with holding. hd thesis, Cornell University, [1] H. Matzinger. Reconstructing a three-color scenery by observing it along a simple random walk path. Random Structures Algorithms, 15():19{7, [13] H. Matzinger. Reconstructing a -color scenery by observing it along a simple random walk path. Eurandom Report -3,. [14] H. Matzinger and S. W. W. Rolles. Reconstructing a random scenery observed with random errors along a random walk path. reprint. 11
The M/G/1 FIFO queue with several customer classes
The M/G/1 FIFO queue with several customer classes Boxma, O.J.; Takine, T. Published: 01/01/2003 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume
More informationOn a set of diophantine equations
On a set of diophantine equations Citation for published version (APA): van Lint, J. H. (1968). On a set of diophantine equations. (EUT report. WSK, Dept. of Mathematics and Computing Science; Vol. 68-WSK-03).
More informationA note on non-periodic tilings of the plane
A note on non-periodic tilings of the plane de Bruijn, N.G. Published: 01/01/1985 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please
More informationOnline algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J.
Online algorithms for parallel job scheduling and strip packing Hurink, J.L.; Paulus, J.J. Published: 01/01/007 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue
More informationGeometry explains the large difference in the elastic properties of fcc and hcp crystals of hard spheres Sushko, N.; van der Schoot, P.P.A.M.
Geometry explains the large difference in the elastic properties of fcc and hcp crystals of hard spheres Sushko, N.; van der Schoot, P.P.A.M. Published in: Physical Review E DOI: 10.1103/PhysRevE.72.067104
More informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More informationThe calculation of stable cutting conditions in turning
The calculation of stable cutting conditions in turning Citation for published version (APA): Kals, H. J. J. (1972). The calculation of stable cutting conditions in turning. (TH Eindhoven. Afd. Werktuigbouwkunde,
More informationA Note on Powers in Finite Fields
Downloaded from orbit.dtu.dk on: Jul 11, 2018 A Note on Powers in Finite Fields Aabrandt, Andreas; Hansen, Vagn Lundsgaard Published in: International Journal of Mathematical Education in Science and Technology
More informationPolydiagnostic study on a surfatron plasma at atmospheric pressure
Polydiagnostic study on a surfatron plasma at atmospheric pressure Citation for published version (APA): Palomares, J. M., Iordanova, E. I., Gamero, A., Sola, A., & Mullen, van der, J. J. A. M. (2009).
More informationMulti (building)physics modeling
Multi (building)physics modeling van Schijndel, A.W.M. Published: 01/01/2010 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check
More informationAn optimization problem related to the storage of solar energy van der Wal, J.
An optimization problem related to the storage of solar energy van der Wal, J. Published: 01/01/1987 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume
More informationThermodynamics of monomer partitioning in polymer latices: effect of molar volume of the monomers
Thermodynamics of monomer partitioning in polymer latices: effect of molar volume of the monomers Citation for published version (APA): Schoonbrood, H. A. S., & German, A. L. (1994). Thermodynamics of
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
Magnetic susceptibility of PbSnMnTe in the transition region between ferromagnetic and spin glass phase Story, T.; Galazka, R.R.; Eggenkamp, Paul; Swagten, H.J.M.; de Jonge, W.J.M. Published in: Acta Physica
More informationOptimal free parameters in orthonormal approximations
Optimal free parameters in orthonormal approximations den Brinker, A.C.; Belt, H.J.W. Published in: IEEE Transactions on Signal Processing DOI: 10.1109/78.705414 Published: 01/01/1998 Document Version
More informationTilburg University. Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: Link to publication
Tilburg University Strongly Regular Graphs with Maximal Energy Haemers, W. H. Publication date: 2007 Link to publication Citation for published version (APA): Haemers, W. H. (2007). Strongly Regular Graphs
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
On the temperature dependence of the Arrhenius activation energy for hydroisomerization catalyzed by Pt/Mordenite Runstraat, van de, A.; van Grondelle, J.; van Santen, R.A. Published in: Journal of Catalysis
More informationNotes on cooperative research in the measurement of Gottwein-temperature Veenstra, P.C.
Notes on cooperative research in the measurement of Gottwein-temperature Veenstra, P.C. Published: 01/01/1969 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue
More informationSpatial decay rate of speech in open plan offices: the use of D2,S and Lp,A,S,4m as building requirements Wenmaekers, R.H.C.; Hak, C.C.J.M.
Spatial decay rate of speech in open plan offices: the use of D2,S and Lp,A,S,4m as building requirements Wenmaekers, R.H.C.; Hak, C.C.J.M. Published in: Euronoise 2015, the 10th European Congress and
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
Effect of molar mass ratio of monomers on the mass distribution of chain lengths and compositions in copolymers: extension of the Stockmayer theory Tacx, J.C.J.F.; Linssen, H.N.; German, A.L. Published
More informationSimulations with a dynamic reaction-diffusion model of the polymer grating preparation by patterned ultraviolet illumination
Simulations with a dynamic reaction-diffusion model of the polymer grating preparation by patterned ultraviolet illumination Citation for published version (APA): Leewis, C. M., Jong, de, A. M., IJzendoorn,
More informationVisualizing multiple quantile plots
Visualizing multiple quantile plots Boon, M.A.A.; Einmahl, J.H.J.; McKeague, I.W. Published: 01/01/2011 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and
More informationStrongly 2-connected orientations of graphs
Downloaded from orbit.dtu.dk on: Jul 04, 2018 Strongly 2-connected orientations of graphs Thomassen, Carsten Published in: Journal of Combinatorial Theory. Series B Link to article, DOI: 10.1016/j.jctb.2014.07.004
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
3-D analytical calculation of the torque between perpendicular magnetized magnets in magnetic suspensions Janssen, J.L.G.; Paulides, J.J.H.; Lomonova, E.A. Published in: IEEE Transactions on Magnetics
More informationMinimum analysis time in capillary gas chromatography. Vacuum- versus atmospheric-outlet column operation Leclercq, P.A.; Cramers, C.A.M.G.
Minimum analysis time in capillary gas chromatography. Vacuum- versus atmospheric-outlet column operation Leclercq, P.A.; Cramers, C.A.M.G. Published in: HRC & CC, Journal of High Resolution Chromatography
More informationOn the Unique D1 Equilibrium in the Stackelberg Model with Asymmetric Information Janssen, M.C.W.; Maasland, E.
Tilburg University On the Unique D1 Equilibrium in the Stackelberg Model with Asymmetric Information Janssen, M.C.W.; Maasland, E. Publication date: 1997 Link to publication General rights Copyright and
More informationA zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
Downloaded from orbit.dtu.dk on: Sep 02, 2018 A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees Perrett, Thomas Published in: Discrete Mathematics Link to article, DOI:
More informationSCENERY RECONSTRUCTION: AN OVERVIEW
SCENERY RECONSTRUCTION: AN OVERVIEW Heinrich Matzinger 1 and Jüri Lember 2 GEORGIA TECH School of Mathematics, Georgia Tech, Atlanta, Georgia 30332-0160, USA UNIVERSITY OF TARTU J. Liivi 2-513, Tartu,
More informationLidar calibration What s the problem?
Downloaded from orbit.dtu.dk on: Feb 05, 2018 Lidar calibration What s the problem? Courtney, Michael Publication date: 2015 Document Version Peer reviewed version Link back to DTU Orbit Citation (APA):
More informationSolubility of CO2 in the low-viscous ionic liquid 1-ethyl-3- methylimidazolium tris(pentafluoroethyl)trifluorophosphate
Solubility of CO2 in the low-viscous ionic liquid 1-ethyl-3- methylimidazolium tris(pentafluoroethyl)trifluorophosphate Citation for published version (APA): Althuluth, M. A. M., Mota Martinez, M. T.,
More informationSolution to problem 87-6* : The entropy of a Poisson distribution Boersma, J.
Solution to problem 87-6* : The entropy of a Poisson distribution Boersma, J. Published in: SIAM Review DOI: 10.1137/10359 Published: 01/01/1988 Document Version Publisher s PDF, also known as Version
More informationMassively parallel molecular-continuum simulations with the macro-micro-coupling tool Neumann, P.; Harting, J.D.R.
Massively parallel molecular-continuum simulations with the macro-micro-coupling tool Neumann, P.; Harting, J.D.R. Published in: Hybrid particle-continuum methods in computational materials physics, 4-7
More informationA relation between perfect equilibria in extensive form games and proper equilibria in normal form games
A relation between perfect equilibria in extensive form games and proper equilibria in normal form games Citation for published version (APA): Damme, van, E. E. C. (1980). A relation between perfect equilibria
More informationComplexity of preemptive minsum scheduling on unrelated parallel machines Sitters, R.A.
Complexity of preemptive minsum scheduling on unrelated parallel machines Sitters, R.A. Published: 01/01/2003 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue
More informationMatrix representation of a Neural Network
Downloaded from orbit.dtu.dk on: May 01, 2018 Matrix representation of a Neural Network Christensen, Bjørn Klint Publication date: 2003 Document Version Publisher's PDF, also known as Version of record
More informationCitation for pulished version (APA): Henning, M. A., & Yeo, A. (2016). Transversals in 4-uniform hypergraphs. Journal of Combinatorics, 23(3).
Syddansk Universitet Transversals in 4-uniform hypergraphs Henning, Michael A; Yeo, Anders Published in: Journal of Combinatorics Publication date: 2016 Document version Forlagets udgivne version Document
More informationJacobi-Davidson methods and preconditioning with applications in pole-zero analysis Rommes, J.; Vorst, van der, H.A.; ter Maten, E.J.W.
Jacobi-Davidson methods and preconditioning with applications in pole-zero analysis Rommes, J.; Vorst, van der, H.A.; ter Maten, E.J.W. Published: 01/01/2003 Document Version Publisher s PDF, also known
More informationModelling Salmonella transfer during grinding of meat
Downloaded from orbit.dtu.dk on: Nov 24, 2018 Modelling Salmonella transfer during grinding of meat Hansen, Tina Beck Publication date: 2017 Document Version Publisher's PDF, also known as Version of record
More informationTilburg University. Two-Dimensional Minimax Latin Hypercube Designs van Dam, Edwin. Document version: Publisher's PDF, also known as Version of record
Tilburg University Two-Dimensional Minimax Latin Hypercube Designs van Dam, Edwin Document version: Publisher's PDF, also known as Version of record Publication date: 2005 Link to publication General rights
More informationInfluence of the shape of surgical lights on the disturbance of the airflow Zoon, W.A.C.; van der Heijden, M.G.M.; Hensen, J.L.M.; Loomans, M.G.L.C.
Influence of the shape of surgical lights on the disturbance of the airflow Zoon, W.A.C.; van der Heijden, M.G.M.; Hensen, J.L.M.; Loomans, M.G.L.C. Published in: Proceedings of the 11th International
More information2 Section 2 However, in order to apply the above idea, we will need to allow non standard intervals ('; ) in the proof. More precisely, ' and may gene
Introduction 1 A dierential intermediate value theorem by Joris van der Hoeven D pt. de Math matiques (B t. 425) Universit Paris-Sud 91405 Orsay Cedex France June 2000 Abstract Let T be the eld of grid-based
More informationPublished in: Proceeding of 9th SENVAR / 2nd ISESEE, Shah Alam, Malaysia, December 2008
Evaluation on Lighting Condition and Visual Legibility of Road Surfaces and Traffic Signs in Bandung City Mangkuto, R.A.; Soelami, F.X.N.; Soegijanto, R.M. Published in: Proceeding of 9th SENVAR / 2nd
More informationPublished in: Proceedings of the 21st Symposium on Mathematical Theory of Networks and Systems
Aalborg Universitet Affine variety codes are better than their reputation Geil, Hans Olav; Martin, Stefano Published in: Proceedings of the 21st Symposium on Mathematical Theory of Networks and Systems
More informationTilburg University. Two-dimensional maximin Latin hypercube designs van Dam, Edwin. Published in: Discrete Applied Mathematics
Tilburg University Two-dimensional maximin Latin hypercube designs van Dam, Edwin Published in: Discrete Applied Mathematics Document version: Peer reviewed version Publication date: 2008 Link to publication
More informationMARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES. Contents
MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES JAMES READY Abstract. In this paper, we rst introduce the concepts of Markov Chains and their stationary distributions. We then discuss
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
Materials analysis with Rutherford backscattering spectrometry; application to catalysts van Ijzendoorn, L.J.; de Voigt, M.J.A.; Niemantsverdriet, J.W. Published in: Reaction Kinetics and Catalysis Letters
More informationVortex statistics for turbulence in a container with rigid boundaries Clercx, H.J.H.; Nielsen, A.H.
Vortex statistics for turbulence in a container with rigid boundaries Clercx, H.J.H.; Nielsen, A.H. Published in: Physical Review Letters DOI: 0.03/PhysRevLett.85.752 Published: 0/0/2000 Document Version
More informationSound absorption properties of a perforated plate and membrane ceiling element Nilsson, Anders C.; Rasmussen, Birgit
Aalborg Universitet Sound absorption properties of a perforated plate and membrane ceiling element Nilsson, Anders C.; Rasmussen, Birgit Published in: Proceedings of Inter-Noise 1983 Publication date:
More informationMarkov processes Course note 2. Martingale problems, recurrence properties of discrete time chains.
Institute for Applied Mathematics WS17/18 Massimiliano Gubinelli Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains. [version 1, 2017.11.1] We introduce
More informationEllipsoidal unfalsified control : stability
Ellipsoidal unfalsified control : stability van Helvoort, J.J.M.; de Jager, A.G.; Steinbuch, M. Published in: Proceedings of the 26 American Control Conference Minneapolis, Minnesota, USA, June 14-16,
More informationSurfactant-free emulsion polymerization of styrene using crosslinked seed particles Eshuis, A.; Leendertse, H.J.; Thoenes, D.
Surfactant-free emulsion polymerization of styrene using crosslinked seed particles Eshuis, A.; Leendertse, H.J.; Thoenes, D. Published in: Colloid and Polymer Science DOI: 10.1007/BF00654115 Published:
More informationAalborg Universitet. Bounds on information combining for parity-check equations Land, Ingmar Rüdiger; Hoeher, A.; Huber, Johannes
Aalborg Universitet Bounds on information combining for parity-check equations Land, Ingmar Rüdiger; Hoeher, A.; Huber, Johannes Published in: 2004 International Seminar on Communications DOI link to publication
More informationDocument Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume numbers)
Impacts of distributed generation penetration levels on power system transient stability Reza, M.; Schavemaker, P.H.; Slootweg, J.G.; Kling, W.L.; Sluis, van der, L. Published in: Proc. IEEE PES General
More informationAalborg Universitet. All P3-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl. Publication date: 2008
Aalborg Universitet All P-equipackable graphs Randerath, Bert; Vestergaard, Preben Dahl Publication date: 2008 Document Version Publisher's PD, also known as Version of record Link to publication from
More informationA test reaction for titanium silicalite catalysts
A test reaction for titanium silicalite catalysts Kraushaar, B.; van Hooff, J.H.C. Published in: Catalysis Letters DOI: 10.1007/BF00765329 Published: 01/01/1989 Document Version Publisher s PDF, also known
More informationA beam theory fracture mechanics approach for strength analysis of beams with a hole
A beam theory fracture mechanics approach for strength analysis of beams with a hole Danielsson, Henrik; Gustafsson, Per-Johan Published in: International Network on Timber Engineering Research - Proceedings
More informationAalborg Universitet. Reparametrizations with given stop data Raussen, Martin Hubert. Publication date: 2008
Aalborg Universitet Reparametrizations with given stop data Raussen, Martin Hubert Publication date: 2008 Document Version Publisher's PDF, also known as Version of record Link to publication from Aalborg
More informationTransmuted distributions and extrema of random number of variables
Transmuted distributions and extrema of random number of variables Kozubowski, Tomasz J.; Podgórski, Krzysztof Published: 2016-01-01 Link to publication Citation for published version (APA): Kozubowski,
More informationAn Equivalent Source Method for Modelling the Lithospheric Magnetic Field Using Satellite and Airborne Magnetic Data
Downloaded from orbit.dtu.dk on: Oct 03, 2018 An Equivalent Source Method for Modelling the Lithospheric Magnetic Field Using Satellite and Airborne Magnetic Data Kother, Livia Kathleen; D. Hammer, Magnus;
More informationScenery Reconstruction
Scenery Reconstruction Dissertation zur Erlangung des Doktorgrades der Fakultät für Mathematik der Universität Bielefeld vorgelegt von Angelica Yohana Pachon Pinzon August 9 Gedruckt auf alterungsbeständigem
More informationUpper and Lower Bounds on the Number of Faults. a System Can Withstand Without Repairs. Cambridge, MA 02139
Upper and Lower Bounds on the Number of Faults a System Can Withstand Without Repairs Michel Goemans y Nancy Lynch z Isaac Saias x Laboratory for Computer Science Massachusetts Institute of Technology
More informationUnknown input observer based scheme for detecting faults in a wind turbine converter Odgaard, Peter Fogh; Stoustrup, Jakob
Aalborg Universitet Unknown input observer based scheme for detecting faults in a wind turbine converter Odgaard, Peter Fogh; Stoustrup, Jakob Published in: Elsevier IFAC Publications / IFAC Proceedings
More informationarxiv: v2 [math.pr] 4 Sep 2017
arxiv:1708.08576v2 [math.pr] 4 Sep 2017 On the Speed of an Excited Asymmetric Random Walk Mike Cinkoske, Joe Jackson, Claire Plunkett September 5, 2017 Abstract An excited random walk is a non-markovian
More informationReducing Uncertainty of Near-shore wind resource Estimates (RUNE) using wind lidars and mesoscale models
Downloaded from orbit.dtu.dk on: Dec 16, 2018 Reducing Uncertainty of Near-shore wind resource Estimates (RUNE) using wind lidars and mesoscale models Floors, Rogier Ralph; Vasiljevic, Nikola; Lea, Guillaume;
More informationAalborg Universitet. The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl. Publication date: 2005
Aalborg Universitet The number of independent sets in unicyclic graphs Pedersen, Anders Sune; Vestergaard, Preben Dahl Publication date: 2005 Document Version Publisher's PDF, also known as Version of
More informationGenerating the optimal magnetic field for magnetic refrigeration
Downloaded from orbit.dtu.dk on: Oct 17, 018 Generating the optimal magnetic field for magnetic refrigeration Bjørk, Rasmus; Insinga, Andrea Roberto; Smith, Anders; Bahl, Christian Published in: Proceedings
More informationUnit vectors with non-negative inner products
Unit vectors with non-negative inner proucts Bos, A.; Seiel, J.J. Publishe: 01/01/1980 Document Version Publisher s PDF, also known as Version of Recor (inclues final page, issue an volume numbers) Please
More informationTwo-phase porous media flows with dynamic capillary effects and hysteresis : uniqueness of weak solutions
Two-phase porous media flows with dynamic capillary effects and hysteresis : uniqueness of weak solutions Citation for published version (APA): Cao, X., & Pop, I. S. (2014). Two-phase porous media flows
More informationSteady State Comparisons HAWC2 v12.2 vs HAWCStab2 v2.12
Downloaded from orbit.dtu.dk on: Jan 29, 219 Steady State Comparisons v12.2 vs v2.12 Verelst, David Robert; Hansen, Morten Hartvig; Pirrung, Georg Publication date: 216 Document Version Publisher's PDF,
More informationSolution: (Course X071570: Stochastic Processes)
Solution I (Course X071570: Stochastic Processes) October 24, 2013 Exercise 1.1: Find all functions f from the integers to the real numbers satisfying f(n) = 1 2 f(n + 1) + 1 f(n 1) 1. 2 A secial solution
More informationA PROBABILISTIC MODEL FOR CASH FLOW
A PROBABILISTIC MODEL FOR CASH FLOW MIHAI N. PASCU Communicated by the former editorial board We introduce and study a probabilistic model for the cash ow in a society in which the individuals decide to
More informationSimulation of three mutually coupled oscillators
Simulation of three mutually coupled oscillators Mirzavand, R.; Schilders, W.H.A.; Abdipour, A. Published: 1/1/21 Document Version Publisher s PDF, also known as Version of Record (includes final page,
More informationAalborg Universitet. Lecture 14 - Introduction to experimental work Kramer, Morten Mejlhede. Publication date: 2015
Aalborg Universitet Lecture 14 - Introduction to experimental work Kramer, Morten Mejlhede Publication date: 2015 Document Version Publisher's PDF, also known as Version of record Link to publication from
More informationThe dipole moment of a wall-charged void in a bulk dielectric
Downloaded from orbit.dtu.dk on: Dec 17, 2017 The dipole moment of a wall-charged void in a bulk dielectric McAllister, Iain Wilson Published in: Proceedings of the Conference on Electrical Insulation
More information1 Introduction This work follows a paper by P. Shields [1] concerned with a problem of a relation between the entropy rate of a nite-valued stationary
Prexes and the Entropy Rate for Long-Range Sources Ioannis Kontoyiannis Information Systems Laboratory, Electrical Engineering, Stanford University. Yurii M. Suhov Statistical Laboratory, Pure Math. &
More informationBalance properties of multi-dimensional words
Theoretical Computer Science 273 (2002) 197 224 www.elsevier.com/locate/tcs Balance properties of multi-dimensional words Valerie Berthe a;, Robert Tijdeman b a Institut de Mathematiques de Luminy, CNRS-UPR
More information1 Introduction It will be convenient to use the inx operators a b and a b to stand for maximum (least upper bound) and minimum (greatest lower bound)
Cycle times and xed points of min-max functions Jeremy Gunawardena, Department of Computer Science, Stanford University, Stanford, CA 94305, USA. jeremy@cs.stanford.edu October 11, 1993 to appear in the
More informationOn the Einstein-Stern model of rotational heat capacities
Downloaded from orbit.dtu.dk on: Jan 06, 2018 On the Einstein-Stern model of rotational heat capacities Dahl, Jens Peder Published in: Journal of Chemical Physics Link to article, DOI: 10.1063/1.77766
More informationA product form solution to a system with multi-type jobs and multi-type servers Visschers, J.W.C.H.; Adan, I.J.B.F.; Weiss, G.
A product form solution to a system with multi-type jobs and multi-type servers Visschers, JWCH; Adan, IJBF; Weiss, G Published: 01/01/2011 Document Version Publisher s PDF, also known as Version of Record
More informationUniversity of Groningen. Statistical inference via fiducial methods Salomé, Diemer
University of Groningen Statistical inference via fiducial methods Salomé, Diemer IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please
More informationTheorem 1. Suppose that is a Fuchsian group of the second kind. Then S( ) n J 6= and J( ) n T 6= : Corollary. When is of the second kind, the Bers con
ON THE BERS CONJECTURE FOR FUCHSIAN GROUPS OF THE SECOND KIND DEDICATED TO PROFESSOR TATSUO FUJI'I'E ON HIS SIXTIETH BIRTHDAY Toshiyuki Sugawa x1. Introduction. Supposebthat D is a simply connected domain
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More informationAccurate magnetic field calculations for contactless energy transfer coils Sonntag, C.L.W.; Spree, M.; Lomonova, E.; Duarte, J.L.; Vandenput, A.J.A.
Accurate magnetic field calculations for contactless energy transfer coils onntag, C.L.W.; pree, M.; Lomonova,.; Duarte, J.L.; Venput, A.J.A. Published in: Proceedings of the 16th International Conference
More informationSolutions Final Exam May. 14, 2014
Solutions Final Exam May. 14, 2014 1. (a) (10 points) State the formal definition of a Cauchy sequence of real numbers. A sequence, {a n } n N, of real numbers, is Cauchy if and only if for every ɛ > 0,
More informationNotes on Iterated Expectations Stephen Morris February 2002
Notes on Iterated Expectations Stephen Morris February 2002 1. Introduction Consider the following sequence of numbers. Individual 1's expectation of random variable X; individual 2's expectation of individual
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationAalborg Universitet. Published in: IEEE International Conference on Acoustics, Speech, and Signal Processing. Creative Commons License Unspecified
Aalborg Universitet Model-based Noise PSD Estimation from Speech in Non-stationary Noise Nielsen, Jesper jær; avalekalam, Mathew Shaji; Christensen, Mads Græsbøll; Boldt, Jesper Bünsow Published in: IEEE
More informationThe structure of a nucleolytic ribozyme that employs a catalytic metal ion Liu, Yijin; Wilson, Timothy; Lilley, David
University of Dundee The structure of a nucleolytic ribozyme that employs a catalytic metal ion Liu, Yijin; Wilson, Timothy; Lilley, David Published in: Nature Chemical Biology DOI: 10.1038/nchembio.2333
More informationValidity of PEC Approximation for On-Body Propagation
Downloaded from orbit.dtu.dk on: Nov, 208 Validity of PEC Approximation for On-Body Propagation Kammersgaard, Nikolaj Peter Brunvoll; Kvist, Søren Helstrup; Thaysen, Jesper; Jakobsen, Kaj Bjarne Published
More informationAalborg Universitet. Land-use modelling by cellular automata Hansen, Henning Sten. Published in: NORDGI : Nordic Geographic Information
Aalborg Universitet Land-use modelling by cellular automata Hansen, Henning Sten Published in: NORDGI : Nordic Geographic Information Publication date: 2006 Document Version Publisher's PDF, also known
More informationUpper and Lower Bounds of Frequency Interval Gramians for a Class of Perturbed Linear Systems Shaker, Hamid Reza
Aalborg Universitet Upper and Lower Bounds of Frequency Interval Gramians for a Class of Perturbed Linear Systems Shaker, Hamid Reza Published in: 7th IFAC Symposium on Robust Control Design DOI (link
More informationSingle Shooting and ESDIRK Methods for adjoint-based optimization of an oil reservoir
Downloaded from orbit.dtu.dk on: Dec 2, 217 Single Shooting and ESDIRK Methods for adjoint-based optimization of an oil reservoir Capolei, Andrea; Völcker, Carsten; Frydendall, Jan; Jørgensen, John Bagterp
More informationDesign of a basic angle monitoring system in Silicon Carbide
Design of a basic angle monitoring system in Silicon Carbide Citation for published version (APA): Veggel, van, A. A., Rosielle, P. C. J. N., Nijmeijer, H., Wielders, A. A., & Vink, H. J. P. (2005). Design
More informationInventory control with partial batch ordering
Inventory control with partial batch ordering Alp, O.; Huh, W.T.; Tan, T. Published: 01/01/2009 Document Version Publisher s PDF, also known as Version of Record (includes final page, issue and volume
More informationReflection of sound from finite-size plane and curved surfaces
Downloaded from orbit.dtu.dk on: Sep, 08 Reflection of sound from finite-size plane and curved surfaces Rindel, Jens Holger Published in: Journal of the Acoustical Society of America Publication date:
More information1 More concise proof of part (a) of the monotone convergence theorem.
Math 0450 Honors intro to analysis Spring, 009 More concise proof of part (a) of the monotone convergence theorem. Theorem If (x n ) is a monotone and bounded sequence, then lim (x n ) exists. Proof. (a)
More informationSoo Hak Sung and Andrei I. Volodin
Bull Korean Math Soc 38 (200), No 4, pp 763 772 ON CONVERGENCE OF SERIES OF INDEENDENT RANDOM VARIABLES Soo Hak Sung and Andrei I Volodin Abstract The rate of convergence for an almost surely convergent
More informationDenition 2: o() is the height of the well-founded relation. Notice that we must have o() (2 ) +. Much is known about the possible behaviours of. For e
Possible behaviours for the Mitchell ordering James Cummings Math and CS Department Dartmouth College Hanover NH 03755 January 23, 1998 Abstract We use a mixture of forcing and inner models techniques
More informationKommerciel arbejde med WAsP
Downloaded from orbit.dtu.dk on: Dec 19, 2017 Kommerciel arbejde med WAsP Mortensen, Niels Gylling Publication date: 2002 Document Version Peer reviewed version Link back to DTU Orbit Citation (APA): Mortensen,
More informationPublished in: Proceedings of IECON 2016: 42nd Annual Conference of the IEEE Industrial Electronics Society
Aalborg Universitet Design of Energy Storage Control Strategy to Improve the PV System Power Quality Lei, Mingyu; Yang, Zilong; Wang, Yibo; Xu, Honghua; Meng, Lexuan; Quintero, Juan Carlos Vasquez; Guerrero,
More informationNote Watson Crick D0L systems with regular triggers
Theoretical Computer Science 259 (2001) 689 698 www.elsevier.com/locate/tcs Note Watson Crick D0L systems with regular triggers Juha Honkala a; ;1, Arto Salomaa b a Department of Mathematics, University
More information