Sheng Yu

170 papers A* 1A 1B 9C 21Misc 4Journal 98Unranked 29
YearRankTypeTitle / Venue / Authors
2017 J jnl
A Survey on Operational State Complexity.
J. Autom. Lang. Comb.
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
2015 J jnl
A Survey on Operational State Complexity.
CoRR
Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu
2014 — conf
State Complexity of Combined Operations for Prefix-Free Regular Languages.
Discrete Mathematics and Computer Science
Hae-Sung Eom, Yo-Sub Han, Kai Salomaa, Sheng Yu
2013 J jnl
Undecidability of state complexity.
Int. J. Comput. Math.
Arto Salomaa, Kai Salomaa, Sheng Yu
2012 — conf
Derivatives of Regular Expressions and an Application.
Computation, Physics and Beyond
Haiming Chen, Sheng Yu
2012 J jnl
State Complexity and Approximation.
Int. J. Found. Comput. Sci.
Yuan Gao, Sheng Yu
2012 J jnl
State Complexity of Combined Operations with Union, Intersection, Star and Reversal.
Fundam. Informaticae
Yuan Gao, Sheng Yu
2012 J jnl
State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal.
Int. J. Found. Comput. Sci.
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2012 J jnl
State complexity of combined operations with two basic operations.
Theor. Comput. Sci.
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2012 J jnl
State complexity of union and intersection of square and reversal on k regular languages.
Theor. Comput. Sci.
Yuan Gao, Lila Kari, Sheng Yu
2012 J jnl
State complexity of union and intersection of star on k regular languages.
Theor. Comput. Sci.
Yuan Gao, Lila Kari, Sheng Yu
2012 — ch.
Statecharts.
Handbook of Finite State Based Models and Applications
Hanlin Lu, Sheng Yu
2011 C conf
Derick Wood: Always in Our Hearts.
CIAA
Sheng Yu
2011 J jnl
Preface.
Int. J. Found. Comput. Sci.
Sheng Yu
2011 C conf
State Complexity Research and Approximation.
Developments in Language Theory
Sheng Yu, Yuan Gao
2011 — conf
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal.
DCFS
Yuan Gao, Sheng Yu
2011 J jnl
State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection.
Int. J. Found. Comput. Sci.
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2011 J jnl
Transition Complexity of Incomplete DFAs.
Fundam. Informaticae
Yuan Gao, Kai Salomaa, Sheng Yu
2011 C conf
Undecidability of the State Complexity of Composed Regular Operations.
LATA
Arto Salomaa, Kai Salomaa, Sheng Yu
2010 C ed.
Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings
Developments in Language Theory
Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu
2010 J jnl
On implementing recognizable transductions.
Int. J. Comput. Math.
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
2010 J jnl
Seventy Years Derick Wood.
J. Univers. Comput. Sci.
Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu
2010 — conf
State Complexity of Catenation Combined with Star and Reversal
DCFS
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2010 C conf
State Complexity of Catenation Combined with Union and Intersection.
CIAA
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2010 J jnl
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation
CoRR
Bo Cui, Yuan Gao, Lila Kari, Sheng Yu
2010 J jnl
State complexity of union and intersection combined with star and reversal
CoRR
Yuan Gao, Sheng Yu
2010 J jnl
Subword Occurrences, Parikh Matrices and Lyndon Images.
Int. J. Found. Comput. Sci.
Arto Salomaa, Sheng Yu
2010 — conf
Transition Complexity of Incomplete DFAs
DCFS
Yuan Gao, Kai Salomaa, Sheng Yu
2009 C conf
Are Statecharts Finite Automata?
CIAA
Hanlin Lu, Sheng Yu
2009 J jnl
Deciding determinism of caterpillar expressions.
Theor. Comput. Sci.
Kai Salomaa, Sheng Yu, Jinfeng Zan
2009 J jnl
Estimation of state complexity of combined operations.
Theor. Comput. Sci.
Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
2009 J jnl
Hierarchy and equivalence of multi-letter quantum finite automata.
Theor. Comput. Sci.
Daowen Qiu, Sheng Yu
2009 — conf
State Complexity Approximation
DCFS
Yuan Gao, Sheng Yu
2009 C conf
State Complexity of Combined Operations for Prefix-Free Regular Languages.
LATA
Yo-Sub Han, Kai Salomaa, Sheng Yu
2009 J jnl
Variants of codes and indecomposable languages.
Inf. Comput.
Arto Salomaa, Kai Salomaa, Sheng Yu
2008 — conf
Estimation of State Complexity of Combined Operations.
DCFS
Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu
2008 J jnl
Hierarchy and equivalence of multi-letter quantum finite automata
CoRR
Daowen Qiu, Sheng Yu
2008 C conf
Length Codes, Products of Languages and Primality.
LATA
Arto Salomaa, Kai Salomaa, Sheng Yu
2008 J jnl
State complexity of basic language operations combined with reversal.
Inf. Comput.
Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu
2008 J jnl
The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal.
Fundam. Informaticae
Yuan Gao, Kai Salomaa, Sheng Yu
2007 J jnl
A Family of NFAs Free of State Reductions.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2007 J jnl
Cover Automata for Finite Language.
Bull. EATCS
Sheng Yu
2007 C conf
Deterministic Caterpillar Expressions.
CIAA
Kai Salomaa, Sheng Yu, Jinfeng Zan
2007 J jnl
Fuzzification of Rational and Recognizable Sets.
Fundam. Informaticae
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
2007 J jnl
On the State Complexity of Combined Operations and their Estimation.
Int. J. Found. Comput. Sci.
Kai Salomaa, Sheng Yu
2007 J jnl
On the existence of prime decompositions.
Theor. Comput. Sci.
Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu
2007 J jnl
Representation and uniformization of algebraic transductions.
Acta Informatica
Stavros Konstantinidis, Nicolae Santean, Sheng Yu
2007 J jnl
Sc-Expressions in Object-Oriented Languages.
Int. J. Found. Comput. Sci.
Sheng Yu, Qing Zhao
2007 C conf
State Complexity of Basic Operations Combined with Reversal.
LATA
Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu
2007 J jnl
State complexity of combined operations.
Theor. Comput. Sci.
Arto Salomaa, Kai Salomaa, Sheng Yu
2006 J jnl
Nondeterministic Bimachines and Rational Relations with Finite Codomain.
Fundam. Informaticae
Nicolae Santean, Sheng Yu
2006 C conf
On Weakly Ambiguous Finite Transducers.
Developments in Language Theory
Nicolae Santean, Sheng Yu
2006 C conf
On the State Complexity of Combined Operations.
CIAA
Sheng Yu
2006 — conf
State Complexity of Catenation and Reversal Combined with Star.
DCFS
Yuan Gao, Kai Salomaa, Sheng Yu
2006 J jnl
Subword conditions and subword histories.
Inf. Comput.
Arto Salomaa, Sheng Yu
2005 — conf
Adding States into Object Types.
PLC
Haitong Xu, Sheng Yu
2005 — conf
Large NFA Without Mergeable States.
DCFS
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2005 J jnl
Mergible states in large NFA.
Theor. Comput. Sci.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2005 J jnl
Preface.
Int. J. Found. Comput. Sci.
Kai Salomaa, Sheng Yu
2005 B conf
Reducing the Size of NFAs by Using Equivalences and Preorders.
CPM
Lucian Ilie, Roberto Solis-Oba, Sheng Yu
2005 J jnl
State Complexity: Recent Results and Open Problems.
Fundam. Informaticae
Sheng Yu
2005 — conf
Type Theory and Language Constructs for Objects with States.
DCM@ICALP
Haitong Xu, Sheng Yu
2004 C ed.
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers
CIAA
Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu
2004 — conf
On NFA Reductions.
Theory Is Forever
Lucian Ilie, Gonzalo Navarro, Sheng Yu
2004 J jnl
On the state complexity of reversals of regular languages.
Theor. Comput. Sci.
Arto Salomaa, Derick Wood, Sheng Yu
2004 J jnl
Pattern expressions and pattern automata.
Inf. Process. Lett.
Cezar Câmpeanu, Sheng Yu
2004 Misc conf
Process Traces With the Option Operation.
PDPTA
Sheng Yu, Qing Zhao
2004 J jnl
Subword histories and Parikh matrices.
J. Comput. Syst. Sci.
Alexandru Mateescu, Arto Salomaa, Sheng Yu
2004 J jnl
Word Complexity And Repetitions In Words.
Int. J. Found. Comput. Sci.
Lucian Ilie, Sheng Yu, Kaizhong Zhang
2003 J jnl
A Formal Study Of Practical Regular Expressions.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2003 A conf
Fast Algorithms for Extended Regular Expression Matching and Searching.
STACS
Lucian Ilie, Baozhen Shan, Sheng Yu
2003 J jnl
Follow automata.
Inf. Comput.
Lucian Ilie, Sheng Yu
2003 Misc conf
Introduction to Process Traces.
PDPTA
Lucian Ilie, Sheng Yu, Qing Zhao
2003 J jnl
Reducing NFAs by invariant equivalences.
Theor. Comput. Sci.
Lucian Ilie, Sheng Yu
2002 J jnl
Additive Distances and Quasi-Distances Between Words.
J. Univers. Comput. Sci.
Cristian Calude, Kai Salomaa, Sheng Yu
2002 J jnl
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.
Cristian Calude, Kai Salomaa, Sheng Yu
2002 B conf
Algorithms for Computing Small NFAs.
MFCS
Lucian Ilie, Sheng Yu
2002 J jnl
An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.
Int. J. Found. Comput. Sci.
Cezar Câmpeanu, Andrei Paun, Sheng Yu
2002 B conf
Constructing NFA s by Optimal Use of Positions in Regular Expressions.
CPM
Lucian Ilie, Sheng Yu
2002 J jnl
Decidability of EDT0L structural equivalence.
Theor. Comput. Sci.
Kai Salomaa, Sheng Yu
2002 J jnl
Factorizations of Languages and Commutativity Conditions.
Acta Cybern.
Alexandru Mateescu, Arto Salomaa, Sheng Yu
2002 J jnl
Implementation and Application of Automata - Editor's Foreword.
Int. J. Found. Comput. Sci.
Sheng Yu
2002 J jnl
On the robustness of primitive words.
Discret. Appl. Math.
Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu
2002 C conf
Regex and Extended Regex.
CIAA
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2002 Misc conf
Repetition Complexity of Words.
COCOON
Lucian Ilie, Sheng Yu, Kaizhong Zhang
2002 — conf
Repetition Complexity of Words.
DCFS
Lucian Ilie, Sheng Yu, Kaizhong Zhang
2002 J jnl
State Complexity of Finite and Infinite Regular Languages.
Bull. EATCS
Sheng Yu
2002 J jnl
Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.
J. Autom. Lang. Comb.
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2001 J jnl
A sharpening of the Parikh mapping.
RAIRO Theor. Informatics Appl.
Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
2001 J jnl
Class-is-type is inadequate for object reuse.
ACM SIGPLAN Notices
Sheng Yu
2001 C ed.
Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers
CIAA
Sheng Yu, Andrei Paun
2001 C conf
Minimal Covers of Formal Languages.
Developments in Language Theory
Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu
2001 J jnl
Minimal cover-automata for finite languages.
Theor. Comput. Sci.
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
2001 J jnl
On the State Complexity of k-Entry Deterministic Finite Automata.
J. Autom. Lang. Comb.
Markus Holzer, Kai Salomaa, Sheng Yu
2001 J jnl
State Complexity of Regular Languages.
J. Autom. Lang. Comb.
Sheng Yu
2001 — conf
The time dimension of computation models.
Where Mathematics, Computer Science, Linguistics and Biology Meet
Sheng Yu
2001 J jnl
Tree-systems of morphisms.
Acta Informatica
Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu
2001 — ed.
Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin
Words, Semigroups, and Transductions
Masami Ito, Gheorghe Paun, Sheng Yu
2000 — book
A Half-Century of Automata Theory: Celebration and Inspiration
A Half-Century of Automata Theory
Arto Salomaa, Derick Wood, Sheng Yu
2000 J jnl
Alternating finite automata and star-free languages.
Theor. Comput. Sci.
Kai Salomaa, Sheng Yu
2000 C conf
An O(n
CIAA
Andrei Paun, Nicolae Santean, Sheng Yu
2000 J jnl
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.
Theor. Comput. Sci.
Kai Salomaa, Xiuming Wu, Sheng Yu
2000 J jnl
On Fairness of Many-Dimensional Trajectories.
J. Autom. Lang. Comb.
Alexandru Mateescu, Kai Salomaa, Sheng Yu
2000 — ch.
State Complexity of Regular Languages: Finite versus Infinite.
Finite Versus Infinite
Cezar Câmpeanu, Kai Salomaa, Sheng Yu
2000 J jnl
Using DNA to solve the Bounded Post Correspondence Problem.
Theor. Comput. Sci.
Lila Kari, Greg Gloor, Sheng Yu
1999 J jnl
Generalized Fairness and Context-Free Languages.
Acta Cybern.
Kai Salomaa, Sheng Yu
1999 — conf
Metric Lexical Analysis.
WIA
Cristian Calude, Kai Salomaa, Sheng Yu
1999 J jnl
On Synchronization in P Systems.
Fundam. Informaticae
Gheorghe Paun, Sheng Yu
1999 C conf
On the decomposition of finite languages.
Developments in Language Theory
Arto Salomaa, Sheng Yu
1999 — conf
State Complexity of Basic Operations on Finite Languages.
WIA
Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu
1999 J jnl
Synchronization Expressions and Languages.
J. Univers. Comput. Sci.
Kai Salomaa, Sheng Yu
1999 — conf
Synchronization Expressions: Characterization Results and Implementation.
Jewels are Forever
Kai Salomaa, Sheng Yu
1999 J jnl
Towards a DNA Solution to the Shortest Common Superstring Problem.
Int. J. Artif. Intell. Tools
Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu
1998 — ed.
Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers
WIA
Derick Wood, Sheng Yu
1998 J jnl
DNA Computing, Sticker Systems, and Universality.
Acta Informatica
Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu
1998 — conf
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.
Workshop on Implementing Automata
Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu
1998 — conf
Minimal Cover-Automata for Finite Languages.
Workshop on Implementing Automata
Cezar Câmpeanu, Nicolae Santean, Sheng Yu
1998 — conf
Practical Rules for Reduction on the Number of States of a State Diagram.
TOOLS (26)
Jin Ma, Sheng Yu
1998 J jnl
Synchronization Expressions with Extended Join Operation.
Theor. Comput. Sci.
Kai Salomaa, Sheng Yu
1998 — conf
Using DNA to solve the Bounded Post Correspondence Problem.
MCU (1)
Lila Kari, Greg Gloor, Sheng Yu
1997 — conf
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.
DNA Based Computers
Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu
1997 — ed.
Automata Implementation, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, Revised Papers
WIA
Darrell R. Raymond, Derick Wood, Sheng Yu
1997 C conf
Decidability of fairness for context-free languages.
Developments in Language Theory
Alexandru Mateescu, Kai Salomaa, Sheng Yu
1997 — conf
Efficient Implementation of Regular Languages Using R-AFA.
Workshop on Implementing Automata
Kai Salomaa, Xiuming Wu, Sheng Yu
1997 J jnl
Language-theoretic Complexity of Disjunctive Sequences.
Discret. Appl. Math.
Cristian Calude, Sheng Yu
1997 J jnl
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.
J. Autom. Lang. Comb.
Kai Salomaa, Sheng Yu
1997 — ch.
Regular Languages.
Handbook of Formal Languages (1)
Sheng Yu
1997 — conf
Rewriting Rules for Synchronization Languages.
Structures in Logic and Computer Science
Kai Salomaa, Sheng Yu
1996 — conf
EDTOL Structural Equivalence is Decidable.
DMTCS
Kai Salomaa, Sheng Yu
1996 — conf
NFA to DFA Transformation for Finite Languages.
Workshop on Implementing Automata
Kai Salomaa, Sheng Yu
1996 J jnl
On Synchronization Languages.
Fundam. Informaticae
Lifu Guo, Kai Salomaa, Sheng Yu
1996 J jnl
Structural Equivalence and ET0L Grammars.
Theor. Comput. Sci.
Kai Salomaa, Derick Wood, Sheng Yu
1995 J jnl
Complexity of E0L Structural Equivalence.
RAIRO Theor. Informatics Appl.
Kai Salomaa, Derick Wood, Sheng Yu
1995 J jnl
Decision Problems for Patterns.
J. Comput. Syst. Sci.
Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
1995 J jnl
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.
J. Univers. Comput. Sci.
Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
1995 C conf
Nondeterminism Degrees for Context-Free Languages.
Developments in Language Theory
Kai Salomaa, Sheng Yu
1995 J jnl
P, NP and the Post Correspondence Problem
Inf. Comput.
Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu
1994 B conf
Complexity of E0L Structural Equivalence.
MFCS
Kai Salomaa, Derick Wood, Sheng Yu
1994 J jnl
Measures of Nondeterminism for Pushdown Automata.
J. Comput. Syst. Sci.
Kai Salomaa, Sheng Yu
1994 J jnl
Pumping and Pushdown Machines.
RAIRO Theor. Informatics Appl.
Kai Salomaa, Derick Wood, Sheng Yu
1994 — conf
Rediscovering Pushdown Machines.
Results and Trends in Theoretical Computer Science
Kai Salomaa, Derick Wood, Sheng Yu
1994 — conf
Synchronization expressions and languages.
SPDP
Lifu Guo, Kai Salomaa, Sheng Yu
1994 J jnl
The State Complexities of Some Basic Operations on Regular Languages.
Theor. Comput. Sci.
Sheng Yu, Qingyu Zhuang, Kai Salomaa
1994 J jnl
Transducers and the Decidability of Independence in Free Monoids.
Theor. Comput. Sci.
Helmut Jürgensen, Kai Salomaa, Sheng Yu
1994 J jnl
on Sparse Languages L such that LL = Sigma.
Discret. Appl. Math.
Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu
1993 J jnl
Decidability of the Intercode Property.
J. Inf. Process. Cybern.
Helmut Jürgensen, Kai Salomaa, Sheng Yu
1993 A* conf
Inclusion is Undecidable for Pattern Languages.
ICALP
Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu
1993 J jnl
Morphisms and rational tranducers.
Bull. EATCS
Kai Salomaa, Sheng Yu
1993 B conf
Structural Equivalences and ET0L Grammars (Extended Abstract).
FCT
Kai Salomaa, Derick Wood, Sheng Yu
1992 J jnl
Attempting guards in parallel: A data flow approach to execute generalized guarded commands.
Int. J. Parallel Program.
R. Govindarajan, Sheng Yu, V. S. Lakshmanan
1992 B conf
Characterizing Regular Languages with Polynomial Densities.
MFCS
Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey O. Shallit
1992 Misc conf
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization.
SAC
Abdelaziz Fellah, Sheng Yu
1992 C conf
Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.
ICCI
Sheng Yu, Qingyu Zhuang, Kai Salomaa
1991 J jnl
Cellular automata, omegaomega-regular sets, and sofic systems.
Discret. Appl. Math.
Karel Culík II, Sheng Yu
1991 — conf
Data Flow Implementation of Generalized Guarded Commands.
PARLE (1)
R. Govindarajan, Sheng Yu
1991 J jnl
Decidability of Structural Equivalence of E0L Grammars.
Theor. Comput. Sci.
Kai Salomaa, Sheng Yu
1991 B conf
Degrees of Nondeterminism for Pushdown Automata.
FCT
Kai Salomaa, Sheng Yu
1991 J jnl
On the state complexity of intersection of regular languages.
SIGACT News
Sheng Yu, Qingyu Zhuang
1991 B conf
ParC project: practical constructs for parallel programming languages.
COMPSAC
R. Govindarajan, Lifu Guo, Sheng Yu, P. Wang
1991 J jnl
Primary Types of Instances of the Post Correspondence Problem.
Bull. EATCS
Arto Salomaa, Kai Salomaa, Sheng Yu
1990 J jnl
Constructions for alternating finite automata.
Int. J. Comput. Math.
Abdelaziz Fellah, Helmut Jürgensen, Sheng Yu
1990 J jnl
The Immortality Problem for LAG Systems.
Inf. Process. Lett.
Kai Salomaa, Sheng Yu
1989 J jnl
On the Limit Sets of Cellular Automata.
SIAM J. Comput.
Karel Culík II, Jan K. Pachl, Sheng Yu
1988 J jnl
Can the catenation of two weakly sparse languages be dense?
Discret. Appl. Math.
Sheng Yu
1988 J jnl
Undecidability of CA Classification Schemes.
Complex Syst.
Karel Culík II, Sheng Yu
1986 J jnl
A property of real-time trellis automata.
Discret. Appl. Math.
Sheng Yu
1986 J jnl
On the equivalence of grammars inferred from derivation.
Bull. EATCS
Efim B. Kinber, Arto Salomaa, Sheng Yu
1986 J jnl
Real-Time, Pseudo Real-Time, and Linear-Time ITA.
Theor. Comput. Sci.
Karel Culík II, Sheng Yu
1985 B conf
Translation of Systolic Algorithms between Systems of Different Topology.
ICPP
Karel Culík II, Sheng Yu
1984 J jnl
Iterative Tree Automata.
Theor. Comput. Sci.
Karel Culík II, Sheng Yu