MOS substitution: Difference between revisions
| Line 31: | Line 31: | ||
!| template MOS: | !| template MOS: | ||
|| <code>LXLXLXLXLXX</code> | || <code>LXLXLXLXLXX</code> | ||
!| intvl. class of gen. | !| intvl. class of gen.:(*) | ||
|| 2-steps | || 2-steps | ||
|- | |- | ||
| Line 60: | Line 60: | ||
!| template MOS: | !| template MOS: | ||
|| <code>mXXmXXmXXmXXmXXmXXmXXX</code> | || <code>mXXmXXmXXmXXmXXmXXmXXX</code> | ||
!| intvl. class of gen.: | !| intvl. class of gen.:(*) | ||
|| 3-steps | || 3-steps | ||
|- | |- | ||
| Line 83: | Line 83: | ||
|colspan=2| GS('''m'''+2'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''') || no | |colspan=2| GS('''m'''+2'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''', '''L'''+'''m'''+'''s''') || no | ||
|} | |} | ||
(*) such that the perfect generator has fewer '''X''''s than the imperfect counterpart | |||
== Open questions == | == Open questions == | ||
# When are the GSes obtained via this procedure the shortest possible GSes? | # When are the GSes obtained via this procedure the shortest possible GSes? | ||