Добірка наукової літератури з теми "Bifix code"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся зі списками актуальних статей, книг, дисертацій, тез та інших наукових джерел на тему "Bifix code".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Статті в журналах з теми "Bifix code"
BERNINI, ANTONIO, STEFANO BILOTTA, RENZO PINZANI, and VINCENT VAJNOVSZKI. "A Gray code for cross-bifix-free sets." Mathematical Structures in Computer Science 27, no. 2 (May 11, 2015): 184–96. http://dx.doi.org/10.1017/s0960129515000067.
Повний текст джерелаKunimochi, Yoshiyuki. "Some Properties of Extractable Codes and Insertable Codes." International Journal of Foundations of Computer Science 27, no. 03 (February 2016): 327–42. http://dx.doi.org/10.1142/s0129054116400128.
Повний текст джерелаAffaf, Mohammad. "Maximality on Construction of Ternary Cross Bifix Free Code." ComTech: Computer, Mathematics and Engineering Applications 10, no. 1 (June 30, 2019): 23. http://dx.doi.org/10.21512/comtech.v10i1.4716.
Повний текст джерелаPERRIN, DOMINIQUE. "COMPLETELY REDUCIBLE SETS." International Journal of Algebra and Computation 23, no. 04 (June 2013): 915–41. http://dx.doi.org/10.1142/s0218196713400158.
Повний текст джерелаPRIBAVKINA, ELENA, and EMANUELE RODARO. "STATE COMPLEXITY OF CODE OPERATORS." International Journal of Foundations of Computer Science 22, no. 07 (November 2011): 1669–81. http://dx.doi.org/10.1142/s0129054111008957.
Повний текст джерелаAlmeida, Jorge, Alfredo Costa, Revekka Kyriakoglou, and Dominique Perrin. "On the group of a rational maximal bifix code." Forum Mathematicum 32, no. 3 (May 1, 2020): 553–76. http://dx.doi.org/10.1515/forum-2018-0270.
Повний текст джерелаBruyère, Véronique, and Dominique Perrin. "Maximal bifix codes." Theoretical Computer Science 218, no. 1 (April 1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.
Повний текст джерелаAffaf, Moh, and Zaiful Ulum. "KONSTRUKSI KODE CROSS BIFIX BEBAS TERNAIR BERPANJANG GENAP UNTUK MENGATASI MASALAH SINKRONISASI FRAME." JIKO (Jurnal Informatika dan Komputer) 2, no. 2 (October 12, 2017): 109. http://dx.doi.org/10.26798/jiko.2017.v2i2.69.
Повний текст джерелаLi, Zheng-Zhu, H. J. Shyr, and Y. S. Tsai. "Annihilators of bifix codes." International Journal of Computer Mathematics 83, no. 1 (January 2006): 81–99. http://dx.doi.org/10.1080/00207160500112910.
Повний текст джерелаLi, Zheng-Zhu, and Y. S. Tsai. "Classifications of bifix codes." International Journal of Computer Mathematics 87, no. 12 (October 2010): 2625–43. http://dx.doi.org/10.1080/00207160902927055.
Повний текст джерелаДисертації з теми "Bifix code"
Dolce, Francesco. "Codes bifixes, combinatoire des mots et systèmes dynamiques symboliques." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1036/document.
Повний текст джерелаSets of words of linear complexity play an important role in combinatorics on words and symbolic dynamics.This family of sets includes set of factors of Sturmian and Arnoux-Rauzy words, interval exchange sets and primitive morphic sets, that is, sets of factors of fixed points of primitive morphisms.The leading issue of this thesis is the study of minimal dynamical systems, also defined equivalently as uniformly recurrent sets of words.As a main result, we consider a natural hierarchy of minimal systems containing neutral sets, tree sets and specular sets.Moreover, we connect the minimal systems to the free group using the notions of return words and basis of subroups of finite index.Symbolic dynamical systems arising from interval exchanges and linear involutions provide us geometrical examples of this kind of sets.One of the main tool used here is the study of possible extensions of a word in a set, that allows us to determine properties such as the factor complexity.In this manuscript we define the extension graph, an undirected graph associated to each word $w$ in a set $S$ which describes the possible extensions of $w$ in $S$ on the left and the right.In this thesis we present several classes of sets of words defined by the possible shapes that the graphs of elements in the set can have.One of the weakest condition that we will study is the neutrality condition: a word $w$ is neutral if the number of pairs $(a, b)$ of letters such that $awb in S$ is equal to the number of letters $a$ such that $aw in S$ plus the number of letters $b$ such that $wb in S$ minus 1.A set such that every nonempty word satisfies the neutrality condition is called a neutral set.A stronger condition is the tree condition: a word $w$ satisfies this condition if its extension graph is both acyclic and connected.A set is called a tree set if any nonempty word satisfies this condition.The family of recurrent tree sets appears as a the natural closure of two known families, namely the Arnoux-Rauzy sets and the interval exchange sets.We also introduce specular sets, a remarkable subfamily of the tree sets.These are subsets of groups which form a natural generalization of free groups.These sets of words are an abstract generalization of the natural codings of interval exchanges and of linear involutions.For each class of sets considered in this thesis, we prove several results concerning closure properties (under maximal bifix decoding or under taking derived words), cardinality of the bifix codes and set of return words in these sets, connection between return words and basis of the free groups, as well as between bifix codes and subgroup of the free group.Each of these results is proved under the weakest possible assumptions
Shivkumar, K. M. "On Some Questions Involving Prefix Codes." Thesis, 2018. https://etd.iisc.ac.in/handle/2005/4719.
Повний текст джерелаLi, Zheng-Zhu, and 李正竹. "Classifications of Bifix Codes." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/wws7bf.
Повний текст джерела中原大學
應用數學研究所
93
Bifix codes are the most important and useful codes in the whole code theory. In this dissertation we investigate the classifications of bifix codes. We split the family of bifix codes into several subfamilies, namely the strict intercode of index $m$ where $m geq 0$, denoted by $B_m(X)$. We study some combinatorial properties of these languages in $B_m(X)$. We also study the properties of annihilators of a given bifix code. For a bifix code $L$, we constructs several methods to determine the index $m$ such that $L$ is a strict intercode of index $m$. Especially when $L$ is finite, some methods are algorithms. Finally we provide some characterizations on automata with different number of states which accept different types of codes, such as bifix codes, infix codes, comma-codes and comma-free codes.
Частини книг з теми "Bifix code"
Almeida, Jorge, Alfredo Costa, Revekka Kyriakoglou, and Dominique Perrin. "Groups of Bifix Codes." In Profinite Semigroups and Symbolic Dynamics, 215–63. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55215-2_8.
Повний текст джерелаDolce, Francesco, and Dominique Perrin. "Return Words and Bifix Codes in Eventually Dendric Sets." In Lecture Notes in Computer Science, 167–79. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-28796-2_13.
Повний текст джерела