Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

The efficiency of any cryptographic algorithms depends on both security and operational speed. When a message is encrypted using… Expand

Is this relevant?

2016

2016

We continue our study of the class of Fibonacci-automatic words. These are infinite words whose nth term is defined in terms of a… Expand

Is this relevant?

2015

2015

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a… Expand

Is this relevant?

2014

2014

In this paper we introduce a family of infinite words that generalize the Fibonacci word and we study their combinatorial… Expand

Is this relevant?

2014

2014

We implement a decision procedure for answering questions about a class of infinite words that might be called (for lack of a… Expand

Is this relevant?

2013

2013

David S. Simon,1,2 Nate Lawrence,2 Jacob Trevino,3 Luca Dal Negro,2,3,* and Alexander V. Sergienko2,4,† 1Department of Physics… Expand

Is this relevant?

2012

2012

For a binary word f, let Q"d(f) be the subgraph of the d-dimensional cube Q"d induced on the set of all words that do not contain… Expand

Is this relevant?

Highly Cited

2006

Highly Cited

2006

Abstract We consider a new class of square Fibonacci ( p + 1) × ( p + 1)-matrices, which are based on the Fibonacci p -numbers… Expand

Is this relevant?

1991

1991

Finite-state automata are used as a simple model of computation since only a finite memory is needed. The problem of passing from… Expand

Is this relevant?

1986

1986

Proof is given that no regular or synchronizable universal codeword sets can achieve optimality. Some asymptotic properties of a… Expand

Is this relevant?