Bibliografías temáticas / Bifix code / Artículos de revistas

Artículos de revistas sobre el tema "Bifix code"

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Bifix code.
Autor: Grafiati
Publicado: 6 de septiembre de 2023

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 19 mejores artículos de revistas para su investigación sobre el tema "Bifix code".

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.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

BERNINI, ANTONIO, STEFANO BILOTTA, RENZO PINZANI y VINCENT VAJNOVSZKI. "A Gray code for cross-bifix-free sets". Mathematical Structures in Computer Science 27, n.º 2 (11 de mayo de 2015): 184–96. http://dx.doi.org/10.1017/s0960129515000067.

Texto completo
Resumen
A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed in Cheeet al.(2013) within a constant factor of optimality. We propose a Gray code for these cross-bifix-free sets and a CAT algorithm generating it. Our Gray code list is trace partitioned, that is, words with zero in the same positions are consecutive in the list.
Los estilos APA, Harvard, Vancouver, ISO, etc.
2

Kunimochi, Yoshiyuki. "Some Properties of Extractable Codes and Insertable Codes". International Journal of Foundations of Computer Science 27, n.º 03 (febrero de 2016): 327–42. http://dx.doi.org/10.1142/s0129054116400128.

Texto completo
Resumen
This paper deals with insertability and mainly extractablity of codes. A code C is called insertable (or extractable) if the free submonoid C* generated by C satisfies if z, [Formula: see text] implies [Formula: see text] (or z, [Formula: see text] implies [Formula: see text]). We show that a finite insertable code is a full uniform code. On the other hand there are many finite extractable codes which are not full uniform codes. We cannot still characterize the structures of infinite extractable codes. Here we give some results on the class of infix extractable codes. First, we consider a necessary and sufficient condition whether a given infix code C is extractable or not by using the syntactic graph of the code. Secondly, we investigate the extractability for the families of other related bifix codes. We newly define the bifix codes, called e(m)-codes and [Formula: see text]-codes, and refer to the extractability of them.
Los estilos APA, Harvard, Vancouver, ISO, etc.
3

Affaf, Mohammad. "Maximality on Construction of Ternary Cross Bifix Free Code". ComTech: Computer, Mathematics and Engineering Applications 10, n.º 1 (30 de junio de 2019): 23. http://dx.doi.org/10.21512/comtech.v10i1.4716.

Texto completo
Resumen
The purpose of this research was to show that ternary cross bifix free code CBFS3(2m+1) and CBFS3(2m+2) achieved the maximum for every natural number m. This research was a literature review. A cross bifix free codes was constructed by using Dyck path method which achieved the maximality, that was non-expandable on binary set sequences for appropriate length. This result is obtained by partitioning members of CBFS3(2m+1) and CBFS3(2m+2) and comparing them with the maximality of CBFS2(2m+1) and CBFS2(2m+2). For small length 3, the result also shows that the code CBFS3(3) is optimal.
Los estilos APA, Harvard, Vancouver, ISO, etc.
4

PERRIN, DOMINIQUE. "COMPLETELY REDUCIBLE SETS". International Journal of Algebra and Computation 23, n.º 04 (junio de 2013): 915–41. http://dx.doi.org/10.1142/s0218196713400158.

Texto completo
Resumen
We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give a new proof of the result concerning cyclic sets.
Los estilos APA, Harvard, Vancouver, ISO, etc.
5

PRIBAVKINA, ELENA y EMANUELE RODARO. "STATE COMPLEXITY OF CODE OPERATORS". International Journal of Foundations of Computer Science 22, n.º 07 (noviembre de 2011): 1669–81. http://dx.doi.org/10.1142/s0129054111008957.

Texto completo
Resumen
We consider five operators on a regular language. Each of them is a tool for constructing a code (respectively prefix, suffix, bifix, infix) and a hypercode out of a given regular language. We give the precise values of the (deterministic) state complexity of these operators: over a constant-size alphabet for the first four of them and over a quadratic-size alphabet for the hypercode operator.
Los estilos APA, Harvard, Vancouver, ISO, etc.
6

Almeida, Jorge, Alfredo Costa, Revekka Kyriakoglou y Dominique Perrin. "On the group of a rational maximal bifix code". Forum Mathematicum 32, n.º 3 (1 de mayo de 2020): 553–76. http://dx.doi.org/10.1515/forum-2018-0270.

Texto completo
Resumen
AbstractWe give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F-group of {Z\cap F}, when F is recurrent and {Z\cap F} is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of {Z\cap F}, receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of F.
Los estilos APA, Harvard, Vancouver, ISO, etc.
7

Bruyère, Véronique y Dominique Perrin. "Maximal bifix codes". Theoretical Computer Science 218, n.º 1 (abril de 1999): 107–21. http://dx.doi.org/10.1016/s0304-3975(98)00253-9.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
8

Affaf, Moh y Zaiful Ulum. "KONSTRUKSI KODE CROSS BIFIX BEBAS TERNAIR BERPANJANG GENAP UNTUK MENGATASI MASALAH SINKRONISASI FRAME". JIKO (Jurnal Informatika dan Komputer) 2, n.º 2 (12 de octubre de 2017): 109. http://dx.doi.org/10.26798/jiko.2017.v2i2.69.

Texto completo
Resumen
In order to guarantee the synchronization between a transmited data by transmitter and received data by receiver can be done by periodically inserting a fixed sequence into the transmited data. It is one of the main topic in digital communication systems which called Frame Synchronization. Study of Cross Bifix Free Codes arise to solve Synchronization’s problem via distributed sequence’s method which introducted first in 2000. A Cross Bifix Free Codes is a set of sequences in which no prefix of any length of less than to of any sequences is the sufix of any sequence in the set. In 2012, a Binary Cross Bifix Free Codes was constructed by using Dyck path. In 2017, a Ternary Cross Bifix Free Codes with odd lenght was constructed, , by generalize the construction of binary cross bifix free. In this paper, will be constructed Ternary Cross Bifix Free Codes for even length, , by expand the construction of Binary Cross Bifix Free Codes.
Los estilos APA, Harvard, Vancouver, ISO, etc.
9

Li, Zheng-Zhu, H. J. Shyr y Y. S. Tsai. "Annihilators of bifix codes". International Journal of Computer Mathematics 83, n.º 1 (enero de 2006): 81–99. http://dx.doi.org/10.1080/00207160500112910.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
10

Li, Zheng-Zhu y Y. S. Tsai. "Classifications of bifix codes". International Journal of Computer Mathematics 87, n.º 12 (octubre de 2010): 2625–43. http://dx.doi.org/10.1080/00207160902927055.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
11

Berthé, Valérie, Clelia De Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer y Giuseppina Rindone. "Bifix codes and interval exchanges". Journal of Pure and Applied Algebra 219, n.º 7 (julio de 2015): 2781–98. http://dx.doi.org/10.1016/j.jpaa.2014.09.028.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
12

Berstel, Jean, Clelia De Felice, Dominique Perrin, Christophe Reutenauer y Giuseppina Rindone. "Bifix codes and Sturmian words". Journal of Algebra 369 (noviembre de 2012): 146–202. http://dx.doi.org/10.1016/j.jalgebra.2012.07.013.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
13

Liang, Zhang y Shen Zhonghui. "Completion of recognizable bifix codes". Theoretical Computer Science 145, n.º 1-2 (julio de 1995): 345–55. http://dx.doi.org/10.1016/0304-3975(94)00300-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
14

Bai, Liyan, Lianyan Jin y Yun Liu. "Maximal Bifix Codes of Degree 3". Bulletin of the Malaysian Mathematical Sciences Society 41, n.º 3 (8 de julio de 2016): 1393–407. http://dx.doi.org/10.1007/s40840-016-0399-y.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
15

Bajic, Dragana y Tatjana Loncar-Turukalo. "A simple suboptimal construction of cross-bifix-free codes". Cryptography and Communications 6, n.º 1 (8 de agosto de 2013): 27–37. http://dx.doi.org/10.1007/s12095-013-0088-8.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
16

Chee, Y. M., H. M. Kiah, P. Purkayastha y Chengmin Wang. "Cross-Bifix-Free Codes Within a Constant Factor of Optimality". IEEE Transactions on Information Theory 59, n.º 7 (julio de 2013): 4668–74. http://dx.doi.org/10.1109/tit.2013.2252952.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
17

Bernini, Antonio, Stefano Bilotta, Renzo Pinzani, Ahmad Sabri y Vincent Vajnovszki. "Prefix partitioned gray codes for particular cross-bifix-free sets". Cryptography and Communications 6, n.º 4 (10 de septiembre de 2014): 359–69. http://dx.doi.org/10.1007/s12095-014-0105-6.

Texto completo
Los estilos APA, Harvard, Vancouver, ISO, etc.
18

Albert, C., J. Kromer, A. M. Robertson y D. Bothe. "Dynamic behaviour of buoyant high viscosity droplets rising in a quiescent liquid". Journal of Fluid Mechanics 778 (4 de agosto de 2015): 485–533. http://dx.doi.org/10.1017/jfm.2015.393.

Texto completo
Resumen
The present paper initiates a systematic computational analysis of the rise dynamics of high viscosity droplets in a viscous ambient liquid. This represents a relevant intermediate case between free rigid particles and bubbles since their shape adjusts to outer forces while almost no inner circulation is present. As a prototype system, we study corn oil droplets rising in pure water with diameters ranging from 0.5 to 16 mm. Since we are interested in the droplet dynamics from the viewpoint of a bifurcation scenario with increasingly complex droplet behaviour, we perform fully three-dimensional numerical simulations, employing the in-house volume-of-fluid (VOF)-code FS3D. The smallest droplets (0.5–2 mm) rise in steady vertical paths, where for the smallest droplet (0.5 mm) the flow field, as well as the terminal velocity, can be described by the Taylor and Acrivos approximate solution, despite the Reynolds number being well above one. Larger droplets (3.2 mm) rise in an oblique path and display a bifid wake, and those with diameters in the range (3.7–8 mm) rise in intermittently oblique paths, showing an intermittent bifid wake of alternating vorticity. The droplets’ shapes in this range change from spherical into oblate ellipsoids of increasing eccentricity, followed by bi-ellipsoidal shapes with higher curvature on the downstream side. Even larger droplets (10–16 mm) rise in oscillatory, essentially vertical paths with drastically different wake structures, including deadzones and aperiodic or periodic vortex shedding. The largest considered droplets (diameter of 14 and 16 mm) display significant shape oscillations and vortex shedding is accompanied by a complex evolution of coherent vortex structures. Their rise paths are best described as zigzagging, but the bifurcation scenario seems to be substantially different from that leading to the zigzagging of air bubbles. In contrast to the rise behaviour of bubbles, helical paths are not observed in the present study.
Los estilos APA, Harvard, Vancouver, ISO, etc.
19

Costa, Alfredo. "A profinite approach to complete bifix decodings of recurrent languages". Forum Mathematicum, 29 de junio de 2023. http://dx.doi.org/10.1515/forum-2022-0246.

Texto completo
Resumen
Abstract We approach the study of complete bifix decodings of (uniformly) recurrent languages with the help of free profinite monoids. We show that the complete bifix decoding of a uniformly recurrent language F by an F-charged rational complete bifix code is uniformly recurrent. An analogous result is obtained for recurrent languages. As an application of the machinery developed within this approach, we show that the maximal pronilpotent quotient of the Schützenberger group of an irreducible symbolic dynamical system is an invariant of eventual conjugacy.
Los estilos APA, Harvard, Vancouver, ISO, etc.
Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!

Pasar a la bibliografía