All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 6 Next

Displaying 101 – 120 of 893

Showing per page

An aperiodicity problem for multiwords

Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen (2012)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They extend the notion of partial words. A word w is certain in a multiword M if it occurs in every word that can be obtained by selecting one single symbol among the symbols provided in each position of M. Motivated by a problem on incomplete databases, we investigate a variant of the pattern matching problem which is to decide whether a word w is certain in a multiword M. We study the language CERTAIN(w)...

An aperiodicity problem for multiwords

Véronique Bruyère, Olivier Carton, Alexandre Decan, Olivier Gauwin, Jef Wijsen (2012)

RAIRO - Theoretical Informatics and Applications

Multiwords are words in which a single symbol can be replaced by a nonempty set of symbols. They extend the notion of partial words. A word w is certain in a multiword M if it occurs in every word that can be obtained by selecting one single symbol among the symbols provided in each position of M. Motivated by a problem on incomplete databases, we investigate a variant of the pattern matching problem which is to decide whether a word w is certain in a multiword M. We study the language CERTAIN(w)...

An application of the theory of intuitionistic fuzzy multigraphs.

Krassimir Atanassov, B. K. Papadopoulos, A. Syropoulos (2004)

Mathware and Soft Computing

In a recent paper by one of the authors it has been shown that there is a relationship between algebraic structures and labeled transition systems. Indeed, it has been shown that an algebraic structures can be viewed as labeled transition systems, which can also be viewed as multigraphs. In this paper, we extend this work by providing an estimation of the transition possibilities between vertices that are connected with multiarcs.

An attractive class of bipartite graphs

Rodica Boliac, Vadim Lozin (2001)

Discussiones Mathematicae Graph Theory

In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.

An exercise on Fibonacci representations

Jean Berstel (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.

An Exercise on Fibonacci Representations

Jean Berstel (2010)

RAIRO - Theoretical Informatics and Applications

We give a partial answer to a question of Carlitz asking for a closed formula for the number of distinct representations of an integer in the Fibonacci base.

Analyzing sets of phylogenetic trees using metrics

Damian Bogdanowicz (2011)

Applicationes Mathematicae

The reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetic trees and give some basic properties of the Matching Split metric, which...

Antiassociative groupoids

Milton Braitt, David Hobby, Donald Silberger (2017)

Mathematica Bohemica

Given a groupoid 〈 G , ☆ 〉 , and k ≥ 3 , we say that G is antiassociative if an only if for all x 1 , x 2 , x 3 ∈ G , ( x 1 ☆ x 2 ) ☆ x 3 and x 1 ☆ ( x 2 ☆ x 3 ) are never equal. Generalizing this, 〈 G , ☆ 〉 is k -antiassociative if and only if for all x 1 , x 2 , ... , x k ∈ G , any two distinct expressions made by putting parentheses in x 1 ☆ x 2 ☆ x 3 ☆ ⋯ ☆ x k are never equal. We prove that for every k ≥ 3 , there exist finite groupoids that are k -antiassociative. We then generalize this, investigating when other pairs of groupoid terms can be made never equal.

Approximations diophantiennes des nombres sturmiens

Martine Queffélec (2002)

Journal de théorie des nombres de Bordeaux

Nous établissons pour tout nombre sturmien (de développement dyadique sturmien) des propriétés d'approximation diophantienne très précises, ne dépendant que de l'angle de la suite sturmienne, généralisant ainsi des travaux antérieurs de Ferenczi-Mauduit et Bullett-Sentenac.

Currently displaying 101 – 120 of 893