15 results
Search Results
2. On repetition-free binary words of minimal density : Extended abstract
3. Antisquares and Critical Exponents.
4. Improving the redundancy of Knuth's balancing scheme for packet transmission systems.
5. Proof of a conjecture on 2-isometric words.
6. Generating all minimal petri net unsolvable binary words.
7. Infinite families of 2-isometric and not 3-isometric binary words.
8. The subword complexity of a class of infinite binary words
9. The Theory of Formal Languages and Identities of Nonassociative Algebras.
10. Recognizing binary shuffle squares is NP-hard
11. The Shannon function for the fast calculation of the Arnold complexity of length 2 n binary words for arbitrary n
12. All-optical analog-to-digital converters, hardlimiters, and logic gates.
13. The Shannon function for calculating the Arnold complexity of length 2 n binary words
14. On the normality of multiple covering codes
15. The subword complexity of a class of infinite binary words
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.