Publication:5834367
From MaRDI portal
zbMath0060.02701MaRDI QIDQ5834367
Publication date: 1946
Related Items
An approach to emulating separable graphs, Three generators for minimal writing-space computations, An alternative construction of normal numbers, Efficient reconfiguration algorithms of de Bruijn and Kautz networks into linear arrays, The underlying line digraph structure of some (0, 1)-matrix equations, Optimal parallel execution of complete binary trees and grids into most popular interconnection networks, A note on recursive properties of the de Bruijn, Kautz and FFT digraphs, On the de Bruijn torus problem, Selected combinatorial problems of computational biology, Long-term memory modules, Large alphabets and incompressibility, The origins of combinatorics on words, Restricting SBH ambiguity via restriction enzymes, Design of a d-connected digraph with a minimum number of edges and a quasiminimal diameter, Growing perfect cubes, Playing off-line games with bounded rationality, Minimal polynomials of the modified de Bruijn sequences, 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, 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, Embedding on alphabet overlap digraphs, On the maximum number of distinct factors of a binary string, D2B: A de Bruijn based content-addressable network, Characterizations for some types of DNA graphs, On encodings of spanning trees, A polynomial time equivalence between DNA sequencing and the exact perfect matching problem, De Bruijn digraphs and affine transformations, Minimal Polynomials of the Modified de Bruijn Sequences, Projective de Bruijn Sequences, Hopcroft’s Minimization Technique: Queues or Stacks?, Deterministic Pushdown Automata and Unary Languages, On the Value of Multiple Read/Write Streams for Data Compression, Unnamed Item, Local maps inducing surjective global maps of one-dimensional tessellation automata
