scientific article; zbMATH DE number 3095523

Cited in

(only showing first 100 items - show all)

Error correcting sequence and projective de Bruijn graph
Investigating the existence and the regularity of logarithmic Harary graphs
On the Hopcroft's minimization technique for DFA and DFCA
On large vertex-symmetric digraphs
de Bruijn sequences and de Bruijn graphs for a general language
Universal cycles for permutations
Minimum Eulerian circuits and minimum de Bruijn sequences
Universal cycles of \((n - 1)\)-partitions of an \(n\)-set
deBruijn-like sequences and the irregular chromatic number of paths and cycles
Irregularity strength of digraphs
The enumeration of shift register sequences
Computation theory of cellular automata
Sufficient conditions for maximally connected dense graphs
Large fault-tolerant interconnection networks
Extensions of networks with given diameter
High density graphs for processor interconnection
Tables of large graphs with given degree and diameter
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
Exact numerical studies of Hamiltonian maps: Iterating without roundoff error
A new look at the de Bruijn graph
Graphs on alphabets as models for large interconnection networks
Broadcasting and spanning trees in de Bruijn and Kautz networks
Broadcasting in DMA-bound bounded degree graphs
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Product-shuffle networks: Toward reconciling shuffles and butterflies
Super edge-connectivity of dense digraphs and graphs
The underlying graph of a line digraph
Universal cycles for combinatorial structures
A class of nonlinear de Bruijn cycles
Line-digraphs, arborescences and theorems of Tutte and Knuth
Large generalized cycles
Complexity for finite factors of infinite sequences
Repeated games with \(M\)-period bounded memory (pure strategies)
Counting closed walks in generalized de Bruijn graphs
Weight class distributions of de Bruijn sequences
Graph theoretical issues in computer networks
Decoding perfect maps
Multicover Ucycles
Connectivity and fault-tolerance of hyperdigraphs
Path-sequential labellings of cycles
A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs
Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
Super line-connectivity of consecutive-\(d\) digraphs
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Uniform homomorphisms of de Bruijn and Kautz networks
Bisecting de Bruijn and Kautz graphs
Super link-connectivity of iterated line digraphs.
Clues to the hidden nature of de Bruijn sequences
Graph-theoretical characterization of invertible cellular automata
Words and forbidden factors
Algorithms for the fixed linear crossing number problem
Mapping prefer-opposite to prefer-one de Bruijn sequences
Computing generalized de Bruijn sequences
Graph algorithms for DNA sequencing -- origins, current models and the future
Classification of de Bruijn-based labeled digraphs
On universal partial words
Construction of de Bruijn sequences from product of two irreducible polynomials
Preliminary results on the minimal polynomial of modified de Bruijn sequences
On ideal t-tuple distribution of filtering de Bruijn sequence generators
rDAN: toward robust demand-aware network designs
Quantifying local randomness in human DNA and RNA sequences using Erdös motifs
An interleaved method for constructing de Bruijn sequences
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
Efficient absorbants in generalized de Bruijn digraphs
Liouville, computable, Borel normal and Martin-Löf random numbers
Characterizations of generators for modified de Bruijn sequences
Vertex-symmetric digraphs with small diameter
On the complexities of de-Bruijn sequences
Storage efficient decoding for a class of binary de Bruijn sequences
On the number of cyclically distinct binary sequences having no internal periodicity and satisfying certain equality constraints
Simulating finite automata with context-free grammars.
Recognizing DNA graphs is difficult.
Uniform words
New classes of perfect maps. I
Probabilistic quorums for dynamic systems
Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
Large butterfly Cayley graphs and digraphs
An efficiently generated family of binary de Bruijn sequences
On greedy algorithms for binary de Bruijn sequences
Maximal state complexity and generalized de Bruijn words
Cyclic arrangements with minimum modulo \(m\) winding numbers
On the complexity of recognizing Wheeler graphs
Enumerations of universal cycles for \(k\)-permutations
On ideal \(t\)-tuple distribution of orthogonal functions in filtering de Bruijn generators
Avoidance of split overlaps
Universal arrays
A new linearization method for nonlinear feedback shift registers
Embedding on alphabet overlap digraphs
Normal numbers and nested perfect necklaces
Some negative results related to Poissonian pair correlation problems
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
Approximate Moore graphs are good expanders
On finite presentations of inverse semigroups with zero having polynomial growth
A graph theoretical approach to input design for identification of nonlinear dynamical models
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
Iterated line digraphs are asymptotically dense
On the maximum number of distinct factors of a binary string
D2B: A de Bruijn based content-addressable network
On the nonlinearity of maximum-length NFSR feedbacks
Characterizations for some types of DNA graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5834367)