The size of the largest semiconstant tree aperiodic semigroups on n points (with identity). Currently the largest known transition semigroups of minimal n-state automata recognizing star-free languages, thus a lower bound on the syntactic complexity of star-free languages.
A236410
The size of the largest semiconstant tree aperiodic semigroups on n points (with identity). Currently the largest known transition semigroups of minimal n-state automata recognizing star-free languages, thus a lower bound on the syntactic complexity of star-free languages.
Terms
- a(0) =3a(1) =10a(2) =47a(3) =273a(4) =1849a(5) =14270a(6) =126123a(7) =1269115a(8) =14001629a(9) =169410932a(10) =2224759333a(11) =31405982419a(12) =477984780009
External references
- oeis: A236410