The following pages link to Haiming Chen (Q208299):
Displaying 24 items.
- Deciding determinism of regular languages (Q493651) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Spiking neural P systems with extended rules: universality and languages (Q934976) (← links)
- Context-free grammars for deterministic regular expressions with interleaving (Q2279127) (← links)
- Checking determinism of regular expressions with counting (Q2343138) (← links)
- On trace languages generated by (small) spiking neural P systems (Q2358681) (← links)
- Packet delay analysis on IEEE 802.11 DCF under finite load traffic in multi-hop ad hoc networks (Q2519293) (← links)
- Deterministic Regular Expressions with Interleaving (Q2787424) (← links)
- Derivatives of Regular Expressions and an Application (Q2891325) (← links)
- Checking Determinism of Regular Expressions with Counting (Q3167507) (← links)
- Inferring Deterministic Regular Expression with Unorder (Q3297778) (← links)
- (Q3425575) (← links)
- Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules (Q3585041) (← links)
- A framework of direct financial pay within high-tech company (Q4671159) (← links)
- (Q4825885) (← links)
- (Q5111236) (← links)
- Determining in-house/outsourcing activities of hi-tech project to seek ROS maximization (Q5293430) (← links)
- Deciding Determinism of Unary Languages Is coNP-Complete (Q5300853) (← links)
- Inclusion Test Algorithms for One-Unambiguous Regular Expressions (Q5505596) (← links)
- Derivatives and Finite Automata of Expressions in Star Normal Form (Q5739000) (← links)
- (Q5873210) (← links)
- Theory and Applications of Models of Computation (Q5898909) (← links)
- Pattern matching compilation of functions defined in context-free languages (Q5945841) (← links)
- Algorithms for checking intersection non-emptiness of regular expressions (Q6605358) (← links)
