Displaying similar documents to “Multi-island finite automata and their even computation”

The range of non-linear natural polynomials cannot be context-free

Dömötör Pálvölgyi (2020)

Kybernetika

Similarity:

Suppose that some polynomial f with rational coefficients takes only natural values at natural numbers, i. e., L = { f ( n ) n } . We show that the base- q representation of L is a context-free language if and only if f is linear, answering a question of Shallit. The proof is based on a new criterion for context-freeness, which is a combination of the Interchange lemma and a generalization of the Pumping lemma.

Cobham's theorem for substitutions

Fabien Durand (2011)

Journal of the European Mathematical Society

Similarity:

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let α and β be two multiplicatively independent Perron numbers. Then a sequence x A , where A is a finite alphabet, is both α -substitutive and β -substitutive if and only if x is ultimately...

Complex series and connected sets

B. Jasek

Similarity:

CONTENTSPREFACE..........................................................................................................................................................................3INTRODUCTION............................................................................................................................................................. 41. Notation. 2. Subject of the paper.Chapter I. DECOMPOSITION OF Σ INTO Σ 1 , Σ 2 , Σ 3 , Σ 4 INESSENTIAL RESTRICTIONOF GENERALITY ...............................................................................................................................................................

Generalized 3-edge-connectivity of Cartesian product graphs

Yuefang Sun (2015)

Czechoslovak Mathematical Journal

Similarity:

The generalized k -connectivity κ k ( G ) of a graph G was introduced by Chartrand et al. in 1984. As a natural counterpart of this concept, Li et al. in 2011 introduced the concept of generalized k -edge-connectivity which is defined as λ k ( G ) = min { λ ( S ) : S V ( G ) and | S | = k } , where λ ( S ) denotes the maximum number of pairwise edge-disjoint trees T 1 , T 2 , ... , T in G such that S V ( T i ) for 1 i . In this paper we prove that for any two connected graphs G and H we have λ 3 ( G H ) λ 3 ( G ) + λ 3 ( H ) , where G H is the Cartesian product of G and H . Moreover, the bound is sharp. We also...

Selectors of discrete coarse spaces

Igor Protasov (2022)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Given a coarse space ( X , ) with the bornology of bounded subsets, we extend the coarse structure from X × X to the natural coarse structure on ( { } ) × ( { } ) and say that a macro-uniform mapping f : ( { } ) X (or f : [ X ] 2 X ) is a selector (or 2-selector) of ( X , ) if f ( A ) A for each A { } ( A [ X ] 2 , respectively). We prove that a discrete coarse space ( X , ) admits a selector if and only if ( X , ) admits a 2-selector if and only if there exists a linear order “ " on X such that the family of intervals { [ a , b ] : a , b X , a b } is a base for the bornology .

Sum-product theorems and incidence geometry

Mei-Chu Chang, Jozsef Solymosi (2007)

Journal of the European Mathematical Society

Similarity:

In this paper we prove the following theorems in incidence geometry. 1. There is δ > 0 such that for any P 1 , , P 4 , and Q 1 , , Q n 2 , if there are n ( 1 + δ ) / 2 many distinct lines between P i and Q j for all i , j , then P 1 , , P 4 are collinear. If the number of the distinct lines is < c n 1 / 2 then the cross ratio of the four points is algebraic. 2. Given c > 0 , there is δ > 0 such that for any P 1 , P 2 , P 3 2 noncollinear, and Q 1 , , Q n 2 , if there are c n 1 / 2 many distinct lines between P i and Q j for all i , j , then for any P 2 { P 1 , P 2 , P 3 } , we have δ n distinct lines between P and Q j . 3. Given...