scientific article; zbMATH DE number 3095523

Cited in

(only showing first 100 items - show all)

Cellular automata between sofic tree shifts
Graphs on alphabets as models for large interconnection networks
An effective approach to enumerate universal cycles for k-permutations
Characterizations of generators for modified de Bruijn sequences
\(k\)-universality of regular languages
The underlying line digraph structure of some (0, 1)-matrix equations
Generation of full cycles by a composition of NLFSRs
Some negative results related to Poissonian pair correlation problems
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
Finite state incompressible infinite sequences
Space-efficient representation of truncated suffix trees, with applications to Markov order estimation
The complexity of interacting automata
The Collatz conjecture and de Bruijn graphs
On binary de Bruijn sequences from LFSRs with arbitrary characteristic polynomials
Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks
Bisecting de Bruijn and Kautz graphs
Avoidance of split overlaps
A normal sequence compressed by PPM* but not by Lempel-Ziv 78
Construction for de Bruijn sequences with large stage
A generalization of de Bruijn graphs and classification of endomorphisms of Cuntz algebras by graph invariants
On encodings of spanning trees
On the number of squares in a finite word
Efficient methods of constructing universal cycles for k-permutations
Preliminary results on the minimal polynomial of modified de Bruijn sequences
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Edge minimization in de Bruijn graphs
Large alphabets and incompressibility
Maximal state complexity and generalized de Bruijn words
Progress, gaps and obstacles in the classification of cellular automata
Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
Further results on the nonlinearity of maximum-length NFSR feedbacks
On the maximum order of graphs embedded in surfaces
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
The folded Petersen network: A new versatile multiprocessor interconnection topology
On identities of Rees quotients of free inverse semigroups defined by positive relators
On graphs with finite-time consensus and their use in gradient tracking
Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
Liouville, computable, Borel normal and Martin-Löf random numbers
Sparse factorization of the square all-ones matrix of arbitrary order
scientific article; zbMATH DE number 7559194 (Why is no real title available?)
Nonstandard Analysis of the Behavior of Ergodic Means of Dynamical Systems on Very Big Finite Probability Spaces
The strategic value of recall
Deterministic Pushdown Automata and Unary Languages
D2B: A de Bruijn based content-addressable network
A method for constructing artificial DNA libraries based on generalized de Bruijn sequences
Towards a theory of patches
Finite state complexity
Cyclic arrangements with minimum modulo \(m\) winding numbers
Minimal polynomials of the modified de Bruijn sequences
Normality and finite-state dimension of Liouville numbers
Regular languages in the sliding window model
Iterated line digraphs are asymptotically dense
A class of nonlinear de Bruijn cycles
Constructions of de Bruijn sequences from a full-length shift register and an irreducible LFSR
Spans of preference functions for de Bruijn sequences
Radial Moore graphs of radius three
Universal arrays
On de Bruijn rings and families of almost perfect maps
On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs
An index data structure for matrices, with applications to fast two-dimensional pattern matching
An FPGA accelerated search method for maximum period NLFSRs
Minimum Eulerian circuits and minimum de Bruijn sequences
Universal cycles for permutations
On large vertex-symmetric digraphs
Sufficient conditions for maximally connected dense graphs
Spanners of de Bruijn and Kautz graphs
Broadcasting in DMA-bound bounded degree graphs
Cryptographically Strong de Bruijn Sequences with Large Periods
Extensions of networks with given diameter
Popping superbubbles and discovering clumps: recent developments in biological sequence analysis
Generalizing the classic greedy and necklace constructions of de Bruijn sequences and universal cycles
A graph theoretical approach to input design for identification of nonlinear dynamical models
Efficient absorbants in generalized de Bruijn digraphs
On greedy algorithms for binary de Bruijn sequences
Super edge-connectivity of dense digraphs and graphs
Revision of asymptotic behavior of the complexity of word assembly by concatenation circuits
Missing value replacement in strings and applications
On the Hopcroft's minimization technique for DFA and DFCA
Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays
The parallelism motifs of genomic data analysis
An efficiently generated family of binary de Bruijn sequences
The diameter of cyclic Kautz digraphs
On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
Product-shuffle networks: Toward reconciling shuffles and butterflies
Characterising the linear complexity of span 1 de Bruijn sequences over finite fields.
Line-digraphs, arborescences and theorems of Tutte and Knuth
Distribution of linear and second-highest degree parts of maximum-length feedback functions
Constructing the first (and coolest) fixed-content universal cycle
On the complexity of recognizing Wheeler graphs
Bidirectional Variable-Order de Bruijn Graphs
A linearly computable measure of string complexity
Counting closed walks in generalized de Bruijn graphs
Graph-based optimization of epitope coverage for vaccine antigen design
Discrepancy bounds for normal numbers generated by necklaces in arbitrary base
New classes of perfect maps. I
A construction of a 𝜆-Poisson generic sequence
An efficient generalized shift-rule for the prefer-max de Bruijn sequence
The longest common extension problem revisited and applications to approximate string searching
Super line-connectivity of consecutive-\(d\) digraphs
On system complexity, stability and performance: application to prediction

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)