Sheng Yu
According to our database^{1},
Sheng Yu
authored at least 155 papers
between 1984 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on zbmath.org

on csd.uwo.ca
On csauthors.net:
Bibliography
2017
J. Autom. Lang. Comb., 2017
2014
State Complexity of Combined Operations for PrefixFree Regular Languages.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (19522005)., 2014
2013
Int. J. Comput. Math., 2013
2012
Proceedings of the Handbook of Finite State Based Models and Applications., 2012
State complexity of union and intersection of square and reversal on k regular languages.
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
Theor. Comput. Sci., 2012
Int. J. Found. Comput. Sci., 2012
State Complexity of Two Combined Operations: CatenationStar and CatenationReversal.
Int. J. Found. Comput. Sci., 2012
State Complexity of Combined Operations with Union, Intersection, Star and Reversal.
Fundam. Informaticae, 2012
Proceedings of the Computation, Physics and Beyond, 2012
2011
Int. J. Found. Comput. Sci., 2011
State Complexity of Two Combined Operations: CatenationUnion and CatenationIntersection.
Int. J. Found. Comput. Sci., 2011
Fundam. Informaticae, 2011
Proceedings of the Implementation and Application of Automata, 2011
Proceedings of the Language and Automata Theory and Applications, 2011
Proceedings of the Developments in Language Theory  15th International Conference, 2011
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal.
Proceedings of the Descriptional Complexity of Formal Systems, 2011
2010
J. Univers. Comput. Sci., 2010
Int. J. Found. Comput. Sci., 2010
Int. J. Comput. Math., 2010
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010
State Complexity of Two Combined Operations: ReversalCatenation and StarCatenation
CoRR, 2010
CoRR, 2010
Proceedings of the Implementation and Application of Automata, 2010
2009
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
Theor. Comput. Sci., 2009
Inf. Comput., 2009
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009
Proceedings of the Implementation and Application of Automata, 2009
Proceedings of the Language and Automata Theory and Applications, 2009
2008
Inf. Comput., 2008
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal.
Fundam. Informaticae, 2008
Proceedings of the Language and Automata Theory and Applications, 2008
2007
Theor. Comput. Sci., 2007
Theor. Comput. Sci., 2007
J. Autom. Lang. Comb., 2007
Int. J. Found. Comput. Sci., 2007
Int. J. Found. Comput. Sci., 2007
Fundam. Informaticae, 2007
Cover Automata for Finite Language.
Bull. EATCS, 2007
Acta Informatica, 2007
Proceedings of the Implementation and Application of Automata, 2007
State Complexity of Basic Operations Combined with Reversal.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007
2006
Inf. Comput., 2006
Fundam. Informaticae, 2006
Electron. Notes Theor. Comput. Sci., 2006
Proceedings of the Implementation and Application of Automata, 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
State Complexity of Catenation and Reversal Combined with Star.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems  DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006
2005
Theor. Comput. Sci., 2005
Int. J. Found. Comput. Sci., 2005
Fundam. Informaticae, 2005
Adding States into Object Types.
Proceedings of The 2005 International Conference on Programming Languages and Compilers, 2005
Large NFA Without Mergeable States.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems  DCFS 2005, Como, Italy, June 30, 2005
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005
2004
Theor. Comput. Sci., 2004
J. Comput. Syst. Sci., 2004
Inf. Process. Lett., 2004
Int. J. Found. Comput. Sci., 2004
Process Traces With the Option Operation.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004
Proceedings of the Theory Is Forever, 2004
2003
Theor. Comput. Sci., 2003
Int. J. Found. Comput. Sci., 2003
Inf. Comput., 2003
Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003
Introduction to Process Traces.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003
2002
Theor. Comput. Sci., 2002
J. Univers. Comput. Sci., 2002
Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen  J.UCS Special Issue.
J. Univers. Comput. Sci., 2002
J. Autom. Lang. Comb., 2002
Int. J. Found. Comput. Sci., 2002
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Int. J. Found. Comput. Sci., 2002
State Complexity of Finite and Infinite Regular Languages.
Bull. EATCS, 2002
Discret. Appl. Math., 2002
Acta Cybern., 2002
Proceedings of the Implementation and Application of Automata, 2002
Proceedings of the Mathematical Foundations of Computer Science 2002, 2002
Repetition Complexity of Words.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems  DCFS 2002, London, Canada, August 21, 2002
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002
2001
Theor. Comput. Sci., 2001
ACM SIGPLAN Notices, 2001
J. Autom. Lang. Comb., 2001
J. Autom. Lang. Comb., 2001
RAIRO Theor. Informatics Appl., 2001
Acta Informatica, 2001
Proceedings of the Developments in Language Theory, 5th International Conference, 2001
The time dimension of computation models.
Proceedings of the Where Mathematics, 2001
2000
Theor. Comput. Sci., 2000
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.
Theor. Comput. Sci., 2000
Theor. Comput. Sci., 2000
J. Autom. Lang. Comb., 2000
An O(n<sup>2</sup>) Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Proceedings of the Implementation and Application of Automata, 2000
Proceedings of the Finite Versus Infinite, 2000
1999
J. Univers. Comput. Sci., 1999
Int. J. Artif. Intell. Tools, 1999
Fundam. Informaticae, 1999
Acta Cybern., 1999
Proceedings of the Automata Implementation, 1999
Proceedings of the Automata Implementation, 1999
Proceedings of the Developments in Language Theory, 1999
Synchronization Expressions: Characterization Results and Implementation.
Proceedings of the Jewels are Forever, 1999
1998
Theor. Comput. Sci., 1998
Acta Informatica, 1998
Proceedings of the Automata Implementation, 1998
Proceedings of the TOOLS 1998: 26th International Conference on Technology of ObjectOriented Languages and Systems, 1998
1997
Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997
J. Autom. Lang. Comb., 1997
Discret. Appl. Math., 1997
Proceedings of the Automata Implementation, 1997
Decidability of fairness for contextfree languages.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertiondeletion systems.
Proceedings of the DNA Based Computers, 1997
Proceedings of the Structures in Logic and Computer Science, 1997
1996
Theor. Comput. Sci., 1996
Fundam. Informaticae, 1996
Proceedings of the Automata Implementation, 1996
EDTOL Structural Equivalence is Decidable.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
1995
Inf. Comput., September, 1995
J. Univers. Comput. Sci., 1995
J. Comput. Syst. Sci., 1995
RAIRO Theor. Informatics Appl., 1995
Nondeterminism Degrees for ContextFree Languages.
Proceedings of the Developments in Language Theory II, 1995
1994
Theor. Comput. Sci., 1994
Theor. Comput. Sci., 1994
J. Comput. Syst. Sci., 1994
RAIRO Theor. Informatics Appl., 1994
Discret. Appl. Math., 1994
Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994
Proceedings of the Results and Trends in Theoretical Computer Science, 1994
1993
Decidability of the Intercode Property.
J. Inf. Process. Cybern., 1993
Morphisms and rational tranducers.
Bull. EATCS, 1993
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993
1992
Attempting guards in parallel: A data flow approach to execute generalized guarded commands.
Int. J. Parallel Program., 1992
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization.
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992
Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.
Proceedings of the Computing and Information, 1992
1991
Theor. Comput. Sci., 1991
SIGACT News, 1991
Primary Types of Instances of the Post Correspondence Problem.
Bull. EATCS, 1991
Discret. Appl. Math., 1991
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
Proceedings of the Fifteenth Annual International Computer Software and Applications Conference, 1991
1990
Inf. Process. Lett., 1990
Int. J. Comput. Math., 1990
1989
SIAM J. Comput., 1989
1988
Discret. Appl. Math., 1988
Complex Syst., 1988
1986
Theor. Comput. Sci., 1986
On the equivalence of grammars inferred from derivation.
Bull. EATCS, 1986
Discret. Appl. Math., 1986
1985
Translation of Systolic Algorithms between Systems of Different Topology.
Proceedings of the International Conference on Parallel Processing, 1985
1984
Theor. Comput. Sci., 1984