Maximal state complexity and generalized de Bruijn words
From MaRDI portal
Publication:2113383
DOI10.1016/J.IC.2021.104689OpenAlexW3120801721MaRDI QIDQ2113383FDOQ2113383
Daniel Gabric, Jeffrey Shallit, Štěpán Holub
Publication date: 14 March 2022
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.05442
Cites Work
- Title not available (Why is that?)
- De Bruijn Sequences-A Model Example of the Interaction of Discrete Mathematics and Computer Science
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Normal Recurring Decimals
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quotient complexity of regular languages
- Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs
- Strings with maximally many distinct subsequences and substrings
- On the maximum number of distinct factors of a binary string
- Title not available (Why is that?)
- Cyclic Shift on Prefix-Free Languages
- m-ary closed sequences
- Binary Ring Sequences
- An algorithm for generating shift-register cycles
- An algebraic construction for q-ary shift register sequences
- State complexity of cyclic shift
- Generalized de Bruijn words and the state complexity of conjugate sets
Cited In (2)
Uses Software
This page was built for publication: Maximal state complexity and generalized de Bruijn words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113383)
