Índice
Literatura académica sobre el tema "Zimin words"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Zimin words".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Zimin words"
Carayol, Arnaud y Stefan Göller. "On Long Words Avoiding Zimin Patterns". Theory of Computing Systems 63, n.º 5 (14 de marzo de 2019): 926–55. http://dx.doi.org/10.1007/s00224-019-09914-2.
Texto completoCurrie, J. y V. Linek. "Avoiding Patterns in the Abelian Sense". Canadian Journal of Mathematics 53, n.º 4 (1 de agosto de 2001): 696–714. http://dx.doi.org/10.4153/cjm-2001-028-4.
Texto completoNeganova, Galina D. y Qin Lidong. "Review of the international scientific-practical conference "Languages and Cultures" (23rd to 24th of May, the City of Kostroma, Russia)". Vestnik of Kostroma State University, n.º 3 (2019): 215–18. http://dx.doi.org/10.34216/1998-0817-2019-25-3-215-218.
Texto completoШик, Ида Александровна. "Images of Leningrad in Soviet porcelain art of the 1930s – early 1950s". Искусство Евразии, n.º 2(17) (27 de junio de 2020): 236–54. http://dx.doi.org/10.25712/astu.2518-7767.2020.02.015.
Texto completo안재철. "An Analysis of the Meaning of Commonly Used Buddhist Terminologies - An Examination of the Words 見, 象,․像,․相 found in the Zimen jingxun 緇門警訓 -". BUL GYO HAK YEONGU-Journal of Buddhist Studies 37, n.º ll (diciembre de 2013): 181–234. http://dx.doi.org/10.21482/jbs.37..201312.181.
Texto completoЕгорова, Ю. А., Т. А. Стрелкова y О. И. Нестеренко. "History of the creation and development of the water supply in Samara". Vodosnabzhenie i sanitarnaia tehnika, n.º 9 (13 de septiembre de 2021): 6–13. http://dx.doi.org/10.35776/vst.2021.09.01.
Texto completoAlsancakli, Sacha. "Historiography and language in 17th-century Ottoman Kurdistan: A study of two Turkish translations of the Sharafnāma". Kurdish Studies 6, n.º 2 (29 de octubre de 2018): 171–96. http://dx.doi.org/10.33182/ks.v6i2.456.
Texto completoUsachev, Andrei S. "Theodosius of Vyatka – the Confessor of Ivan the Terrible: Portrait against the Backdrop of the Era". Herald of an archivist, n.º 1 (2021): 11–23. http://dx.doi.org/10.28995/2073-0101-2021-1-11-23.
Texto completoCooper, Joshua y Danny Rorabaugh. "Asymptotic Density of Zimin Words". Discrete Mathematics & Theoretical Computer Science Vol. 18 no. 3, Combinatorics (17 de marzo de 2016). http://dx.doi.org/10.46298/dmtcs.1302.
Texto completoEdwards, Mark. "Implementing an Electronic Notebook in Science". Compass: Journal of Learning and Teaching 3, n.º 6 (1 de diciembre de 2012). http://dx.doi.org/10.21100/compass.v3i6.160.
Texto completoTesis sobre el tema "Zimin words"
Sauer, Paul Van der Merwe. "The complexity of unavoidable word patterns". Thesis, 2019. http://hdl.handle.net/10500/27343.
Texto completoThe avoidability, or unavoidability of patterns in words over finite alphabets has been studied extensively. The word α over a finite set A is said to be unavoidable for an infinite set B+ of nonempty words over a finite set B if, for all but finitely many elements w of B+, there exists a semigroup morphism φ ∶ A+ → B+ such that φ(α) is a factor of w. In this treatise, we start by presenting a historical background of results that are related to unavoidability. We present and discuss the most important theorems surrounding unavoidability in detail. We present various complexity-related properties of unavoidable words. For words that are unavoidable, we provide a constructive upper bound to the lengths of words that avoid them. In particular, for a pattern α of length n over an alphabet of size r, we give a concrete function N(n, r) such that no word of length N(n, r) over the alphabet of size r avoids α. A natural subsequent question is how many unavoidable words there are. We show that the fraction of words that are unavoidable drops exponentially fast in the length of the word. This allows us to calculate an upper bound on the number of unavoidable patterns for any given finite alphabet. Subsequently, we investigate computational aspects of unavoidable words. In particular, we exhibit concrete algorithms for determining whether a word is unavoidable. We also prove results on the computational complexity of the problem of determining whether a given word is unavoidable. Specifically, the NP-completeness of the aforementioned problem is established.
Decision Sciences
D. Phil. (Operations Research)
Ussishkin, Adam. "Target = zimen (real word); prime = hexerim (real word)". 2011. http://hdl.handle.net/10150/344977.
Texto completoLibros sobre el tema "Zimin words"
Xian dai Han yu zi pin tong ji biao =: Xiandai Hanyu zipin tongji biao. Xin hua shu dian Beijing fa xing suo fa xing, 1992.
Buscar texto completoGraff Zivin, Erin. Anarchaeologies. Fordham University Press, 2020. http://dx.doi.org/10.5422/fordham/9780823286829.001.0001.
Texto completo