The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A306990 Worst-case of deterministic state complexity for cyclic shift of binary language with state complexity n. 0
1, 5, 108, 20237, 56817428 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
For a word w, cyc(w) refers to the set of all cyclic shifts of w. Thus cyc(ate) = {ate, tea, eat}.
For a language (that is, a set of words), cyc(L) is the union of cyc(w) over all w in L.
The deterministic state complexity of a regular language L is the smallest number of states needed by a deterministic finite automaton to accept L.
LINKS
G. Jirásková and A. Okhotin, State complexity of cyclic shift, RAIRO-Theor. Inf. Appl. 42 (2008), 335-360. See table on page 357.
CROSSREFS
Sequence in context: A318986 A220549 A210904 * A048564 A139971 A305095
KEYWORD
nonn,more
AUTHOR
Jeffrey Shallit, Mar 18 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 02:27 EDT 2024. Contains 372847 sequences. (Running on oeis4.)