The following pages link to Sheng Yu (Q418765):
Displayed 50 items.
- (Q236665) (redirect page) (← links)
- (Q387009) (redirect page) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- State complexity of union and intersection of star on \(k\) regular languages (Q418766) (← links)
- State complexity of combined operations with two basic operations (Q441851) (← links)
- On the state complexity of reversals of regular languages (Q596099) (← links)
- Structural equivalence and ET0L grammars (Q671426) (← links)
- State complexity of union and intersection of square and reversal on \(k\) regular languages (Q714820) (← links)
- A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time'' (Q763490) (← links)
- Iterative tree automata (Q796998) (← links)
- Decidability of structural equivalence of E0L grammars (Q807023) (← links)
- Computation theoretic aspects of cellular automata (Q807035) (← links)
- Formal languages and global cellular automaton behavior (Q807036) (← links)
- Pattern expressions and pattern automata (Q834961) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Representation and uniformization of algebraic transductions (Q855271) (← links)
- Subword conditions and subword histories (Q859831) (← links)
- On the existence of prime decompositions (Q880173) (← links)
- The immortality problem for Lag systems (Q918728) (← links)
- State complexity of basic language operations combined with reversal (Q948089) (← links)
- Variants of codes and indecomposable languages (Q1041051) (← links)
- A property of real-time trellis automata (Q1079372) (← links)
- Real-time, pseudo real-time, and linear-time ITA (Q1089799) (← links)
- On a public-key cryptosystem based on iterated morphisms and substitutions (Q1098821) (← links)
- Can the catenation of two weakly sparse languages be dense? (Q1102760) (← links)
- A pumping lemma for deterministic context-free languages (Q1120293) (← links)
- DNA computing, sticker systems, and universality (Q1130166) (← links)
- Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems (Q1179180) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- On sparse languages \(L\) such that \(LL= \Sigma^*\) (Q1331892) (← links)
- Measures of nondeterminism for pushdown automata (Q1337469) (← links)
- Transducers and the decidability of independence in free monoids (Q1341744) (← links)
- On the robustness of primitive words (Q1348393) (← links)
- Physical versus computational complementarity. I (Q1376456) (← links)
- Language-theoretic complexity of disjunctive sequences (Q1382276) (← links)
- Follow automata. (Q1426009) (← links)
- Reducing NFAs by invariant equivalences. (Q1426461) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Efficient implementation of regular languages using reversed alternating finite automata (Q1575901) (← links)
- Using DNA to solve the bounded Post correspondence problem (Q1575917) (← links)
- Decidability of EDT0L structural equivalence (Q1605312) (← links)
- Tree-systems of morphisms (Q1608934) (← links)
- Mergible states in large NFA (Q1763699) (← links)
- Subword histories and Parikh matrices (Q1878676) (← links)
- Decision problems for patterns (Q1892205) (← links)
- P, NP, and the Post correspondence problem (Q1899905) (← links)
- Hierarchy and equivalence of multi-letter quantum finite automata (Q2271440) (← links)
- Estimation of state complexity of combined operations (Q2271462) (← links)
- State complexity of combined operations (Q2383591) (← links)