Sheng Yu

Publication Activity (10 Years)

Years Active: 1984-2017
Publications (10 Years): 1

Top Venues

Theor. Comput. Sci.

Int. J. Found. Comput. Sci.

Discrete Mathematics and Computer Science

Fundam. Informaticae

Publications

Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
A Survey on Operational State Complexity. J. Autom. Lang. Comb. 21 (4) (2017)
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
A Survey on Operational State Complexity. CoRR (2015)
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu
State Complexity of Combined Operations for Prefix-Free Regular Languages. Discrete Mathematics and Computer Science (2014)
Arto Salomaa, Kai Salomaa, Sheng Yu
Undecidability of state complexity. Int. J. Comput. Math. 90 (6) (2013)
Haiming Chen, Sheng Yu
Derivatives of Regular Expressions and an Application. Computation, Physics and Beyond (2012)
Yuan Gao, Lila Kari, Sheng Yu
State complexity of union and intersection of star on k regular languages. Theor. Comput. Sci. 429 (2012)
Yuan Gao, Sheng Yu
State Complexity of Combined Operations with Union, Intersection, Star and Reversal. Fundam. Informaticae 116 (1-4) (2012)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State complexity of combined operations with two basic operations. Theor. Comput. Sci. 437 (2012)
Yuan Gao, Sheng Yu
State Complexity and Approximation. Int. J. Found. Comput. Sci. 23 (5) (2012)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal. Int. J. Found. Comput. Sci. 23 (1) (2012)
Yuan Gao, Lila Kari, Sheng Yu
State complexity of union and intersection of square and reversal on k regular languages. Theor. Comput. Sci. 454 (2012)
Sheng Yu
Preface. Int. J. Found. Comput. Sci. 22 (7) (2011)
Sheng Yu, Yuan Gao
State Complexity Research and Approximation. Developments in Language Theory (2011)
Sheng Yu
Derick Wood: Always in Our Hearts. CIAA (2011)
Arto Salomaa, Kai Salomaa, Sheng Yu
Undecidability of the State Complexity of Composed Regular Operations. LATA (2011)
Yuan Gao, Sheng Yu
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. DCFS (2011)
Yuan Gao, Kai Salomaa, Sheng Yu
Transition Complexity of Incomplete DFAs. Fundam. Informaticae 110 (1-4) (2011)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection. Int. J. Found. Comput. Sci. 22 (8) (2011)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation CoRR (2010)
Yuan Gao, Sheng Yu
State complexity of union and intersection combined with star and reversal CoRR (2010)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
On implementing recognizable transductions. Int. J. Comput. Math. 87 (2) (2010)
Arto Salomaa, Sheng Yu
Subword Occurrences, Parikh Matrices and Lyndon Images. Int. J. Found. Comput. Sci. 21 (1) (2010)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State Complexity of Catenation Combined with Union and Intersection. CIAA (2010)
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
State Complexity of Catenation Combined with Star and Reversal DCFS (2010)
Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu
Seventy Years Derick Wood. J. Univers. Comput. Sci. 16 (5) (2010)
Yuan Gao, Kai Salomaa, Sheng Yu
Transition Complexity of Incomplete DFAs DCFS (2010)
Hanlin Lu, Sheng Yu
Are Statecharts Finite Automata? CIAA (2009)
Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
Estimation of state complexity of combined operations. Theor. Comput. Sci. 410 (35) (2009)
Daowen Qiu, Sheng Yu
Hierarchy and equivalence of multi-letter quantum finite automata. Theor. Comput. Sci. 410 (30-32) (2009)
Kai Salomaa, Sheng Yu, Jinfeng Zan
Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410 (37) (2009)
Arto Salomaa, Kai Salomaa, Sheng Yu
Variants of codes and indecomposable languages. Inf. Comput. 207 (11) (2009)
Yo-Sub Han, Kai Salomaa, Sheng Yu
State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA (2009)
Yuan Gao, Sheng Yu
State Complexity Approximation DCFS (2009)
Yuan Gao, Kai Salomaa, Sheng Yu
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Fundam. Informaticae 83 (1-2) (2008)
Arto Salomaa, Kai Salomaa, Sheng Yu
Length Codes, Products of Languages and Primality. LATA (2008)
Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
Estimation of State Complexity of Combined Operations. DCFS (2008)
Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu
State complexity of basic language operations combined with reversal. Inf. Comput. 206 (9-10) (2008)
Daowen Qiu, Sheng Yu
Hierarchy and equivalence of multi-letter quantum finite automata CoRR (2008)
Kai Salomaa, Sheng Yu
On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18 (4) (2007)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12 (1-2) (2007)
Sheng Yu, Qing Zhao
Sc-Expressions in Object-Oriented Languages. Int. J. Found. Comput. Sci. 18 (6) (2007)
Arto Salomaa, Kai Salomaa, Sheng Yu
State complexity of combined operations. Theor. Comput. Sci. 383 (2-3) (2007)
Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
On the existence of prime decompositions. Theor. Comput. Sci. 376 (1-2) (2007)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76 (4) (2007)
Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu
State Complexity of Basic Operations Combined with Reversal. LATA (2007)
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
Representation and uniformization of algebraic transductions. Acta Informatica 43 (6) (2007)
Kai Salomaa, Sheng Yu, Jinfeng Zan
Deterministic Caterpillar Expressions. CIAA (2007)
Sheng Yu
Cover Automata for Finite Language. Bull. EATCS 92 (2007)
Haitong Xu, Sheng Yu
Type Theory and Language Constructs for Objects with States. Electron. Notes Theor. Comput. Sci. 135 (3) (2006)
Arto Salomaa, Sheng Yu
Subword conditions and subword histories. Inf. Comput. 204 (12) (2006)
Sheng Yu
On the State Complexity of Combined Operations. CIAA (2006)
Nicolae Santean, Sheng Yu
Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Informaticae 73 (1-2) (2006)
Nicolae Santean, Sheng Yu
On Weakly Ambiguous Finite Transducers. Developments in Language Theory (2006)
Yuan Gao, Kai Salomaa, Sheng Yu
State Complexity of Catenation and Reversal Combined with Star. DCFS (2006)
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM (2005)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Mergible states in large NFA. Theor. Comput. Sci. 330 (1) (2005)
Kai Salomaa, Sheng Yu
Preface. Int. J. Found. Comput. Sci. 16 (3) (2005)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Large NFA Without Mergeable States. DCFS (2005)
Sheng Yu
State Complexity: Recent Results and Open Problems. Fundam. Informaticae 64 (1-4) (2005)
Haitong Xu, Sheng Yu
Adding States into Object Types. PLC (2005)
Lucian Ilie, Sheng Yu, Kaizhong Zhang
Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15 (1) (2004)
Alexandru Mateescu, Arto Salomaa, Sheng Yu
Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68 (1) (2004)
Arto Salomaa, Derick Wood, Sheng Yu
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320 (2-3) (2004)
Lucian Ilie, Gonzalo Navarro, Sheng Yu
On NFA Reductions. Theory Is Forever (2004)
Sheng Yu, Qing Zhao
Process Traces With the Option Operation. PDPTA (2004)
Cezar Câmpeanu, Sheng Yu
Pattern expressions and pattern automata. Inf. Process. Lett. 92 (6) (2004)
Lucian Ilie, Sheng Yu
Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306 (1-3) (2003)
Lucian Ilie, Sheng Yu, Qing Zhao
Introduction to Process Traces. PDPTA (2003)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14 (6) (2003)
Lucian Ilie, Sheng Yu
Follow automata. Inf. Comput. 186 (1) (2003)
Lucian Ilie, Baozhen Shan, Sheng Yu
Fast Algorithms for Extended Regular Expression Matching and Searching. STACS (2003)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. J. Autom. Lang. Comb. 7 (3) (2002)
Lucian Ilie, Sheng Yu, Kaizhong Zhang
Repetition Complexity of Words. DCFS (2002)
Cezar Câmpeanu, Andrei Paun, Sheng Yu
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages. Int. J. Found. Comput. Sci. 13 (1) (2002)
Kai Salomaa, Sheng Yu
Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276 (1-2) (2002)
Lucian Ilie, Sheng Yu
Algorithms for Computing Small NFAs. MFCS (2002)
Lucian Ilie, Sheng Yu, Kaizhong Zhang
Repetition Complexity of Words. COCOON (2002)
Cristian Calude, Kai Salomaa, Sheng Yu
Additive Distances and Quasi-Distances Between Words. J. Univers. Comput. Sci. 8 (2) (2002)
Lucian Ilie, Sheng Yu
Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM (2002)
Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu
On the robustness of primitive words. Discret. Appl. Math. 117 (1-3) (2002)
Alexandru Mateescu, Arto Salomaa, Sheng Yu
Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15 (3) (2002)
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
Regex and Extended Regex. CIAA (2002)
Cristian Calude, Kai Salomaa, Sheng Yu
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. 8 (2) (2002)
Sheng Yu
State Complexity of Finite and Infinite Regular Languages. Bull. EATCS 76 (2002)
Sheng Yu
Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13 (1) (2002)
Markus Holzer, Kai Salomaa, Sheng Yu
On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6 (4) (2001)
Sheng Yu
State Complexity of Regular Languages. J. Autom. Lang. Comb. 6 (2) (2001)
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267 (1-2) (2001)
Sheng Yu
The time dimension of computation models. Where Mathematics, Computer Science, Linguistics and Biology Meet (2001)
Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35 (6) (2001)
Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu
Tree-systems of morphisms. Acta Informatica 38 (2) (2001)
Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu
Minimal Covers of Formal Languages. Developments in Language Theory (2001)
Sheng Yu
Class-is-type is inadequate for object reuse. ACM SIGPLAN Notices 36 (6) (2001)
Alexandru Mateescu, Kai Salomaa, Sheng Yu
On Fairness of Many-Dimensional Trajectories. J. Autom. Lang. Comb. 5 (2) (2000)
Kai Salomaa, Sheng Yu
Alternating finite automata and star-free languages. Theor. Comput. Sci. 234 (1-2) (2000)
Andrei Paun, Nicolae Santean, Sheng Yu
) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA (2000)
Lila Kari, Greg Gloor, Sheng Yu
Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231 (2) (2000)
Kai Salomaa, Xiuming Wu, Sheng Yu
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231 (1) (2000)
Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu
Towards a DNA Solution to the Shortest Common Superstring Problem. Int. J. Artif. Intell. Tools 8 (4) (1999)
Kai Salomaa, Sheng Yu
Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever (1999)

Sheng Yu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Sheng Yu