Ming-wei Wang

Affiliations:
  • Microsoft Corporation, Redmond, WA, USA
  • University of Waterloo, Department of Computer Science, Waterloo, Canada (PhD 2004)


According to our database1, Ming-wei Wang authored at least 17 papers between 1998 and 2011.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2011
Inverse star, borders, and palstars.
Inf. Process. Lett., 2011

2005
Avoiding large squares in infinite binary words.
Theor. Comput. Sci., 2005

2004
Regular Expressions: New Results and Open Problems.
J. Autom. Lang. Comb., 2004

Non-Uniqueness and Radius of Cyclic Unary NFAs.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

2003
Periodicity, morphisms, and matrices.
Theor. Comput. Sci., 2003

Cubefree binary words avoiding long squares
CoRR, 2003

2002
Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds.
J. Comput. Syst. Sci., 2002

Regular Expressions: New Results and Open Problems.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Automatic Complexity of Strings.
J. Autom. Lang. Comb., 2001

Weakly Self-Avoiding Words and a Construction of Friedman.
Electron. J. Comb., 2001

Variations on a Theorem of Fine & Wilf.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
On the Irregularity of the Duplication Closure.
Bull. EATCS, 2000

Balanced <i>k</i>-Colorings.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
On Two-Sided Infinite Fixed Points of Morphisms.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

New problems of pattern avoidance.
Proceedings of the Developments in Language Theory, 1999

1998
On Minimal Words With Given Subword Complexity.
Electron. J. Comb., 1998


  Loading...