Journal articles on the topic 'Binary word'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Binary word.'
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.
Teh, Wen Chean. "On Core Words and the Parikh Matrix Mapping." International Journal of Foundations of Computer Science 26, no. 01 (January 2015): 123–42. http://dx.doi.org/10.1142/s0129054115500069.
Full textHolmberg, Anders. "Icelandic Word Order and Binary Branching." Nordic Journal of Linguistics 8, no. 2 (December 1985): 161–95. http://dx.doi.org/10.1017/s0332586500001323.
Full textIlić, Aleksandar, Sandi Klavžar, and Yoomi Rho. "The index of a binary word." Theoretical Computer Science 452 (September 2012): 100–106. http://dx.doi.org/10.1016/j.tcs.2012.05.025.
Full textWang, Yuwei, Yi Zeng, Jianbo Tang, and Bo Xu. "Biological Neuron Coding Inspired Binary Word Embeddings." Cognitive Computation 11, no. 5 (July 24, 2019): 676–84. http://dx.doi.org/10.1007/s12559-019-09643-1.
Full textHADRAVOVÁ, JANA, and ŠTĚPÁN HOLUB. "LARGE SIMPLE BINARY EQUALITY WORDS." International Journal of Foundations of Computer Science 23, no. 06 (September 2012): 1385–403. http://dx.doi.org/10.1142/s0129054112500207.
Full textTissier, Julien, Christophe Gravier, and Amaury Habrard. "Near-Lossless Binarization of Word Embeddings." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 7104–11. http://dx.doi.org/10.1609/aaai.v33i01.33017104.
Full textKowalski, Jacek M., and Andrzej Pękalski. "On evolving chains of cube-free binary sequences." Notes on Number Theory and Discrete Mathematics 27, no. 3 (September 2021): 79–94. http://dx.doi.org/10.7546/nntdm.2021.27.3.79-94.
Full textKumova Metin, Senem, and Bahar Karaoğlan. "STOP WORD DETECTION AS A BINARY CLASSIFICATION PROBLEM." ANADOLU UNIVERSITY JOURNAL OF SCIENCE AND TECHNOLOGY A - Applied Sciences and Engineering 18, no. 2 (June 30, 2017): 1. http://dx.doi.org/10.18038/aubtda.322136.
Full textGabric, Daniel, and Jeffrey Shallit. "The simplest binary word with only three squares." RAIRO - Theoretical Informatics and Applications 55 (2021): 3. http://dx.doi.org/10.1051/ita/2021001.
Full textAnh, V. N., and A. Moffat. "Improved word-aligned binary compression for text indexing." IEEE Transactions on Knowledge and Data Engineering 18, no. 6 (June 2006): 857–61. http://dx.doi.org/10.1109/tkde.2006.99.
Full textAnh, Vo Ngoc, and Alistair Moffat. "Inverted Index Compression Using Word-Aligned Binary Codes." Information Retrieval 8, no. 1 (January 2005): 151–66. http://dx.doi.org/10.1023/b:inrt.0000048490.99518.5c.
Full textCASSAIGNE, JULIEN, GWÉNAËL RICHOMME, KALLE SAARI, and LUCA Q. ZAMBONI. "AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY." International Journal of Foundations of Computer Science 22, no. 04 (June 2011): 905–20. http://dx.doi.org/10.1142/s0129054111008489.
Full textCHEN, XUE, GUANGDA HU, and XIAOMING SUN. "THE COMPLEXITY OF WORD CIRCUITS." Discrete Mathematics, Algorithms and Applications 02, no. 04 (December 2010): 483–92. http://dx.doi.org/10.1142/s1793830910000826.
Full textBera, Somnath, Sastha Sriram, Atulya K. Nagar, Linqiang Pan, and K. G. Subramanian. "Algebraic Properties of Parikh Matrices of Binary Picture Arrays." Journal of Mathematics 2020 (June 29, 2020): 1–7. http://dx.doi.org/10.1155/2020/3236405.
Full textDu, Chen Fei, and Jeffrey Shallit. "Similarity density of the Thue-Morse word with overlap-free infinite binary words." Electronic Proceedings in Theoretical Computer Science 151 (May 21, 2014): 231–45. http://dx.doi.org/10.4204/eptcs.151.16.
Full textBlanchet-Sadri, F., Andrew Lohr, and Shane Scott. "Computing the partial word avoidability indices of binary patterns." Journal of Discrete Algorithms 23 (November 2013): 113–18. http://dx.doi.org/10.1016/j.jda.2013.06.007.
Full textEl-Qawasmeh, Eyas. "Word prediction using a clustered optimal binary search tree." Information Processing Letters 92, no. 5 (December 2004): 257–65. http://dx.doi.org/10.1016/j.ipl.2004.08.006.
Full textGuimin Huang, Guimin Huang, and Maolin Li Guimin Huang. "An Errors Correction Model for the Errors of Non-word and Real-word in English Composition." 電腦學刊 33, no. 1 (February 2022): 138–50. http://dx.doi.org/10.53106/199115992022023301013.
Full textKotlyarov, Nikita V. "Existence of words over a binary alphabet free from squares with mismatches." Discrete Mathematics and Applications 29, no. 3 (June 26, 2019): 175–88. http://dx.doi.org/10.1515/dma-2019-0016.
Full textMoshkov, Mikhail. "Decision Trees for Binary Subword-Closed Languages." Entropy 25, no. 2 (February 14, 2023): 349. http://dx.doi.org/10.3390/e25020349.
Full textLee, Suwon. "Binary Visual Word Generation Techniques for A Fast Image Search." Journal of KIISE 44, no. 12 (December 31, 2017): 1313–18. http://dx.doi.org/10.5626/jok.2017.44.12.1313.
Full textCotter, D., and S. C. Cotter. "Algorithm for binary word recognition suited to ultrafast nonlinear optics." Electronics Letters 29, no. 11 (May 27, 1993): 945–47. http://dx.doi.org/10.1049/el:19930630.
Full textKawabata, Takeshi, and Junta Doi. "Improvement of protein secondary structure prediction using binary word encoding." Proteins: Structure, Function, and Genetics 27, no. 1 (January 1997): 36–46. http://dx.doi.org/10.1002/(sici)1097-0134(199701)27:1<36::aid-prot5>3.0.co;2-l.
Full textAndreev, Andrey, and Nikolay Kirov. "Hausdorff Distances for Searching in Binary Text Images." Serdica Journal of Computing 3, no. 1 (May 15, 2009): 23–46. http://dx.doi.org/10.55630/sjc.2009.3.23-46.
Full textDolce, Francesco, and Edita Pelantová. "On Morphisms Preserving Palindromic Richness." Fundamenta Informaticae 185, no. 1 (March 18, 2022): 1–25. http://dx.doi.org/10.3233/fi-222102.
Full textCrvenković, Siniša, and Igor Dolinka. "A Variety with Undecidable Equational Theory and Solvable Word Problem." International Journal of Algebra and Computation 08, no. 06 (December 1998): 625–30. http://dx.doi.org/10.1142/s0218196798000302.
Full textWang, Xiao Feng, and Hai Jian Li. "Research on Information Hiding Method Based on Word Text." Advanced Materials Research 926-930 (May 2014): 2815–18. http://dx.doi.org/10.4028/www.scientific.net/amr.926-930.2815.
Full textMadry, Małgorzata. "λ-Representability of Integer, Word and Tree Functions." Fundamenta Informaticae 17, no. 3 (September 1, 1992): 253–70. http://dx.doi.org/10.3233/fi-1992-17306.
Full textMARCHÉ, CLAUDE. "THE WORD PROBLEM OF ACD-GROUND THEORIES IS UNDECIDABLE." International Journal of Foundations of Computer Science 03, no. 01 (March 1992): 81–92. http://dx.doi.org/10.1142/s0129054192000085.
Full textBajić, Dragana, Goran Dimić, and Nikola Zogović. "Splitting Sequences for Coding and Hybrid Incremental ARQ with Fragment Retransmission." Mathematics 9, no. 20 (October 17, 2021): 2620. http://dx.doi.org/10.3390/math9202620.
Full textJecker, Ismaël, and Emmanuel Filiot. "Multi-Sequential Word Relations." International Journal of Foundations of Computer Science 29, no. 02 (February 2018): 271–95. http://dx.doi.org/10.1142/s0129054118400075.
Full textZhang, Shi Ru, Xiao Chun Meng, Xin Fu Liu, and Wen Yuan Chen. "A Digital Text Watermarking for Word Document." Applied Mechanics and Materials 614 (September 2014): 347–51. http://dx.doi.org/10.4028/www.scientific.net/amm.614.347.
Full textZacicev, M. V., and D. D. Repovs. "Identities on algebras and combinatorial properties of binary words." Доклады Академии наук 489, no. 5 (December 20, 2019): 449–51. http://dx.doi.org/10.31857/s0869-56524895449-451.
Full textAgo, Kristina, and Bojan Bašić. "On a theorem concerning partially overlapping subpalindromes of a binary word." Advances in Applied Mathematics 134 (March 2022): 102302. http://dx.doi.org/10.1016/j.aam.2021.102302.
Full textRivest, Ronald L. "The invertibility of the XOR of rotations of a binary word." International Journal of Computer Mathematics 88, no. 2 (December 4, 2010): 281–84. http://dx.doi.org/10.1080/00207161003596708.
Full textGao, Jun, and XiXian Chen. "Probabilistic word classification based on a context-sensitive binary tree method." Computer Speech & Language 11, no. 4 (October 1997): 307–20. http://dx.doi.org/10.1006/csla.1997.0033.
Full textNAKANO, KOJI. "PREFIX-SUMS ALGORITHMS ON RECONFIGURABLE MESHES." Parallel Processing Letters 05, no. 01 (March 1995): 23–35. http://dx.doi.org/10.1142/s0129626495000047.
Full textAuinger, Karl. "The word problem for the bifree combinatorial strict regular semigroup." Mathematical Proceedings of the Cambridge Philosophical Society 113, no. 3 (May 1993): 519–33. http://dx.doi.org/10.1017/s0305004100076179.
Full textAl-Jarrah, Ahmad, Amer Albsharat, and Mohammad Al-Jarrah. "Word-based encryption algorithm using dictionary indexing with variable encryption key length." International Journal of Electrical and Computer Engineering (IJECE) 12, no. 1 (February 1, 2022): 669. http://dx.doi.org/10.11591/ijece.v12i1.pp669-683.
Full textDryer, Matthew S. "On the Six-Way Word Order Typology." Studies in Language 21, no. 1 (January 1, 1997): 69–103. http://dx.doi.org/10.1075/sl.21.1.04dry.
Full textRoca, Iggy. "On the sources of word prosody." Phonology 9, no. 2 (August 1992): 267–87. http://dx.doi.org/10.1017/s0952675700001615.
Full textForsyth, Michael, Amlesh Jayakumar, Jarkko Peltomäki, and Jeffrey Shallit. "Remarks on Privileged Words." International Journal of Foundations of Computer Science 27, no. 04 (June 2016): 431–42. http://dx.doi.org/10.1142/s0129054116500088.
Full textBaril, Jean-Luc, Sergey Kirgizov, and Vincent Vajnovszki. "Asymptotic bit frequency in Fibonacci words." Pure Mathematics and Applications 30, no. 1 (June 1, 2022): 23–30. http://dx.doi.org/10.2478/puma-2022-0005.
Full textDu, Chen Fei, Jeffrey Shallit, and Arseny M. Shur. "Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words." International Journal of Foundations of Computer Science 26, no. 08 (December 2015): 1147–65. http://dx.doi.org/10.1142/s012905411540016x.
Full textYasuda, Seigou, Toshiki Kawamoto, Takashi Ariyoshi, Syouji Kuriki, Jun-ichiroh Fujimoto, and Tomofumi Nakatani. "Development of a Spoken Word Recognition System using Binary Time-Spectrum Pattern." IEEJ Transactions on Electronics, Information and Systems 108, no. 10 (1988): 858–65. http://dx.doi.org/10.1541/ieejeiss1987.108.10_858.
Full textThomas, Nobin, Lisa Mathew, Sastha Sriram, Atulya K. Nagar, and K. G. Subramanian. "Certain Distance-Based Topological Indices of Parikh Word Representable Graphs." Journal of Mathematics 2021 (May 25, 2021): 1–7. http://dx.doi.org/10.1155/2021/5567663.
Full textDodel, Jean-Pierre, and Rajjan Shinghal. "Recognition of Handwritten Worded Amounts on Checks Using Symbolic and Neural Classifiers." International Journal of Pattern Recognition and Artificial Intelligence 11, no. 05 (August 1997): 735–55. http://dx.doi.org/10.1142/s0218001497000329.
Full textMIGNOSI, FILIPPO, and ANTONIO RESTIVO. "A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY." International Journal of Algebra and Computation 23, no. 04 (June 2013): 963–87. http://dx.doi.org/10.1142/s0218196713400080.
Full textSALOMAA, ARTO, and SHENG YU. "SUBWORD OCCURRENCES, PARIKH MATRICES AND LYNDON IMAGES." International Journal of Foundations of Computer Science 21, no. 01 (February 2010): 91–111. http://dx.doi.org/10.1142/s0129054110007155.
Full textMalakar, Samir, Manosij Ghosh, Ram Sarkar, and Mita Nasipuri. "Development of a Two-Stage Segmentation-Based Word Searching Method for Handwritten Document Images." Journal of Intelligent Systems 29, no. 1 (July 4, 2018): 719–35. http://dx.doi.org/10.1515/jisys-2017-0384.
Full text