Results 31 to 40 of about 1,883 (72)
Regular languages and associative language descriptions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as ...
Marcella Anselmo +2 more
doaj +1 more source
A geometrical approach of palindromic factors of standard billiard words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Many results are already known, concerning the palindromic factors and the palindomic prefixes of Standard billiard words, i.e., Sturmian words and billiard words in any dimension, starting at the origin.
Jean-Pierre Borel
doaj +1 more source
Digraph Complexity Measures and Applications in Formal Language Theory [PDF]
, 2011 We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages.
Hermann Gruber +1 more
core +4 more sources
On the length of shortest 2-collapsing words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Automata, Logic and ...
Alessandra Cherubini +2 more
doaj +1 more source
On the strengths of connectivity and robustness in general random intersection graphs [PDF]
, 2014 Random intersection graphs have received much attention for nearly two decades, and currently have a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks.
Gligor, Virgil, Yağan, Osman, Zhao, Jun
core +1 more source
Centerpoint theorems for wedges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 General
Jeff Erickson, Ferran Hurtado, Pat Morin
doaj +1 more source
Maker-Breaker domination number [PDF]
, 2019 The Maker-Breaker domination game is played on a graph $G$ by Dominator and Staller. The players alternatively select a vertex of $G$ that was not yet chosen in the course of the game.
Gledel, Valentin +2 more
core +2 more sources
Enumeration of words by the sum of differences between adjacent letters [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Combinatorics
Toufik Mansour
doaj +1 more source
The interactive sum choice number of graphs [PDF]
, 2017 We introduce a variant of the well-studied sum choice number of graphs, which we call the interactive sum choice number. In this variant, we request colours to be added to the vertices' colour-lists one at a time, and so we are able to make use of ...
Bonamy, Marthe, Meeks, Kitty
core +4 more sources
Independent sets in (P₆, diamond)-free graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 Graphs and ...
Raffaele Mosca
doaj +1 more source