2012•Fundamenta InformaticaeRequires access

Pattern 1 j+10 j Avoiding Binary Words

BilottaStefano, MerliniDonatella, PergolaElisa, PinzaniRenzo

Open publisher page 0 citations

Abstract

In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 1j+10j. By means of the theory of Riordan arrays, we solve the enumeration problem and we...

About this research paper

What this paper is about

In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 1j+10j. By means of the theory of Riordan arrays, we solve the enumeration problem and we...

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper we study the enumeration and the construction of particular binary words avoiding the pattern 1j+10j. By means of the theory of Riordan arrays, we solve the enumeration problem and we...

Key concepts: Enumeration, Binary number, Mathematics, Combinatorics, Computer science, Algorithm, Arithmetic

Related papers

Back to paper searchBrowse research topicsOriginal source
Pattern 1 j+10 j Avoiding Binary Words — Research Paper | ScholarLens