Log in

Relevant bibliographies by topics / Bifix code / Journal articles

To see the other types of publications on this topic, follow the link: Bifix code.

Journal articles on the topic 'Bifix code'

Author: Grafiati

Published: 6 September 2023

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 23 journal articles for your research on the topic 'Bifix code.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

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 (2015): 184–96. http://dx.doi.org/10.1017/s0960129515000067.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

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

Full text

Abstract:

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 nece

APA, Harvard, Vancouver, ISO, and other styles

3

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

4

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

5

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

6

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

7

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

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 (2017): 109. http://dx.doi.org/10.26798/jiko.2017.v2i2.69.

Full text

Abstract:

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 Bina

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Berthé, Valérie, Clelia De Felice, Francesco Dolce, et al. "Bifix codes and interval exchanges." Journal of Pure and Applied Algebra 219, no. 7 (2015): 2781–98. http://dx.doi.org/10.1016/j.jpaa.2014.09.028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Georges, Aoun, and Sharrouf Wissam. "Bifid and Trifid Mandibular Canals: Are they Uncommon or Underestimated." International Journal of Medical Science and Clinical Research Studies 04, no. 12 (2024): 2188–91. https://doi.org/10.5281/zenodo.14326858.

Full text

Abstract:

Anatomical variations of the mandibular canal (MC) such as bifid MC (BMC) and trifid MC (TMC) have been largely reported in the scientific literature. They are characterized by two or three accessory canals running roughly parallel to MC. BMC and TMC are incidentally detected during routine dental radiography, and their thorough understanding is necessary to the practitioner to avoid complications during dental procedures. This paper aims to review BMC and TMC and to provide basic knowledge for dental clinical procedures.

APA, Harvard, Vancouver, ISO, and other styles

19

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Jialu, José Pablo Cambronero, Sumit Gulwani, et al. "PyDex: Repairing Bugs in Introductory Python Assignments using LLMs." Proceedings of the ACM on Programming Languages 8, OOPSLA1 (2024): 1100–1124. http://dx.doi.org/10.1145/3649850.

Full text

Abstract:

Students often make mistakes in their introductory programming assignments as part of their learning process. Unfortunately, providing custom repairs for these mistakes can require a substantial amount of time and effort from class instructors. Automated program repair (APR) techniques can be used to synthesize such fixes. Prior work has explored the use of symbolic and neural techniques for APR in the education domain. Both types of approaches require either substantial engineering efforts or large amounts of data and training. We propose to use a large language model trained on code, such as

APA, Harvard, Vancouver, ISO, and other styles

21

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

22

Qin, Chunyan, Bocong Chen, and Gaojun Luo. "Constructions of non-expandable cross-bifix-free codes via expandable codes." IEEE Transactions on Information Theory, 2024, 1. http://dx.doi.org/10.1109/tit.2024.3354675.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Mures, Omar A., and Miguel Cid Montoya. "Signed distance function–biased flow importance sampling for implicit neural compression of flow fields." Computer-Aided Civil and Infrastructure Engineering, June 12, 2025. https://doi.org/10.1111/mice.13526.

Full text

Abstract:

AbstractThe rise of exascale supercomputing has motivated an increase in high‐fidelity computational fluid dynamics (CFD) simulations. The detail in these simulations, often involving shape‐dependent, time‐variant flow domains and low‐speed, complex, turbulent flows, is essential for fueling innovations in fields like wind, civil, automotive, or aerospace engineering. However, the massive amount of data these simulations produce can overwhelm storage systems and negatively affect conventional data management and postprocessing workflows, including iterative procedures such as design space expl

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!