default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSheng Yu 0001
Person information
- affiliation: University of Western Ontario, London, ON, Canada
- affiliation (PhD 1986): University of Waterloo, ON, Canada
Other persons with the same name
- Sheng Yu — disambiguation page
- Sheng Yu 0002
![[0000-0002-6347-0507]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-6347-0507")
— Tsinghua University, Center for Statistical Science / Department of Industrial Engineering, Beijing, China (and 3 more) - Sheng Yu 0003 — Zhongnan University of Economics and Law, School of Business Administration, Wuhan, China (and 1 more)
- Sheng Yu 0004 — Oklahoma State University, Department of Computer Science, Stillwater, OK USA
- Sheng Yu 0005 — Dublin Institute of Technology, School of Electrical Engineering Systems, Ireland
- Sheng Yu 0006 — University of Chinese Academy of Sciences, Research Center of Ubiquitous Sensor Networks, Beijing, China
- Sheng Yu 0007 — Shaoguan University, School of Information Science and Engineering / Provincial Demonstration Software Institute, China (and 1 more)
- Sheng Yu 0008 — University of Oxford, Department of Oncology, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2017
[j94]Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu:
A Survey on Operational State Complexity. J. Autom. Lang. Comb. 21(4): 251-310 (2017)- 2015
- [i4]Yuan Gao, Nelma Moreira, Rogério Reis, Sheng Yu:
A Survey on Operational State Complexity. CoRR abs/1509.03254 (2015) - 2014
- [c62]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: 137-151 - 2013
- [j93]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of state complexity. Int. J. Comput. Math. 90(6): 1310-1320 (2013) - 2012
- [j92]Yuan Gao, Sheng Yu:
State Complexity of Combined Operations with Union, Intersection, Star and Reversal. Fundam. Informaticae 116(1-4): 79-92 (2012) - [j91]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): 51-66 (2012) - [j90]Yuan Gao, Sheng Yu:
State Complexity and Approximation. Int. J. Found. Comput. Sci. 23(5): 1085-1098 (2012) - [j89]Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of star on k regular languages. Theor. Comput. Sci. 429: 98-107 (2012) - [j88]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State complexity of combined operations with two basic operations. Theor. Comput. Sci. 437: 82-102 (2012) - [j87]Yuan Gao, Lila Kari, Sheng Yu:
State complexity of union and intersection of square and reversal on k regular languages. Theor. Comput. Sci. 454: 164-171 (2012) - [c61]Haiming Chen, Sheng Yu:
Derivatives of Regular Expressions and an Application. Computation, Physics and Beyond 2012: 343-356 - [r1]Hanlin Lu, Sheng Yu:
Statecharts. Handbook of Finite State Based Models and Applications 2012: 317-336 - 2011
- [j86]Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. Fundam. Informaticae 110(1-4): 143-158 (2011) - [j85]Sheng Yu:
Preface. Int. J. Found. Comput. Sci. 22(7) (2011) - [j84]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): 1797-1812 (2011) - [c60]Yuan Gao, Sheng Yu:
State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal. DCFS 2011: 158-171 - [c59]Sheng Yu, Yuan Gao:
State Complexity Research and Approximation. Developments in Language Theory 2011: 46-57 - [c58]Arto Salomaa, Kai Salomaa, Sheng Yu:
Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498 - [c57]Sheng Yu:
Derick Wood: Always in Our Hearts. CIAA 2011: 1-2 - 2010
- [j83]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
On implementing recognizable transductions. Int. J. Comput. Math. 87(2): 260-277 (2010) - [j82]Arto Salomaa, Sheng Yu:
Subword Occurrences, Parikh Matrices and Lyndon Images. Int. J. Found. Comput. Sci. 21(1): 91-111 (2010) - [j81]Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu:
Seventy Years Derick Wood. J. Univers. Comput. Sci. 16(5): 577-585 (2010) - [c56]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Union and Intersection. CIAA 2010: 95-104 - [c55]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Catenation Combined with Star and Reversal. DCFS 2010: 58-67 - [c54]Yuan Gao, Kai Salomaa, Sheng Yu:
Transition Complexity of Incomplete DFAs. DCFS 2010: 99-109 - [e7]Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu:
Developments in Language Theory, 14th International Conference, DLT 2010, London, ON, Canada, August 17-20, 2010. Proceedings. Lecture Notes in Computer Science 6224, Springer 2010, ISBN 978-3-642-14454-7 [contents] - [i3]Yuan Gao, Sheng Yu:
State complexity of union and intersection combined with star and reversal. CoRR abs/1006.3755 (2010) - [i2]Bo Cui, Yuan Gao, Lila Kari, Sheng Yu:
State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation. CoRR abs/1006.4646 (2010)
2000 – 2009
- 2009
- [j80]Arto Salomaa, Kai Salomaa, Sheng Yu:
Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009) - [j79]Daowen Qiu, Sheng Yu:
Hierarchy and equivalence of multi-letter quantum finite automata. Theor. Comput. Sci. 410(30-32): 3006-3017 (2009) - [j78]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009) - [j77]Kai Salomaa, Sheng Yu, Jinfeng Zan:
Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410(37): 3438-3446 (2009) - [c53]Yo-Sub Han, Kai Salomaa, Sheng Yu:
State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409 - [c52]Hanlin Lu, Sheng Yu:
Are Statecharts Finite Automata? CIAA 2009: 258-261 - [c51]Yuan Gao, Sheng Yu:
State Complexity Approximation. DCFS 2009: 121-130 - 2008
- [j76]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): 75-89 (2008) - [j75]Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu:
State complexity of basic language operations combined with reversal. Inf. Comput. 206(9-10): 1178-1186 (2008) - [c50]Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu:
Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181 - [c49]Arto Salomaa, Kai Salomaa, Sheng Yu:
Length Codes, Products of Languages and Primality. LATA 2008: 476-486 - [i1]Daowen Qiu, Sheng Yu:
Hierarchy and equivalence of multi-letter quantum finite automata. CoRR abs/0812.0852 (2008) - 2007
- [j74]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
Representation and uniformization of algebraic transductions. Acta Informatica 43(6): 395-417 (2007) - [j73]Sheng Yu:
Cover Automata for Finite Language. Bull. EATCS 92: 65-74 (2007) - [j72]Stavros Konstantinidis, Nicolae Santean, Sheng Yu:
Fuzzification of Rational and Recognizable Sets. Fundam. Informaticae 76(4): 413-447 (2007) - [j71]Kai Salomaa, Sheng Yu:
On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007) - [j70]Sheng Yu, Qing Zhao:
Sc-Expressions in Object-Oriented Languages. Int. J. Found. Comput. Sci. 18(6): 1441-1452 (2007) - [j69]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
A Family of NFAs Free of State Reductions. J. Autom. Lang. Comb. 12(1-2): 69-78 (2007) - [j68]Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu:
On the existence of prime decompositions. Theor. Comput. Sci. 376(1-2): 60-69 (2007) - [j67]Arto Salomaa, Kai Salomaa, Sheng Yu:
State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007) - [c48]Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu:
State Complexity of Basic Operations Combined with Reversal. LATA 2007: 355-366 - [c47]Kai Salomaa, Sheng Yu, Jinfeng Zan:
Deterministic Caterpillar Expressions. CIAA 2007: 97-108 - 2006
- [j66]Nicolae Santean, Sheng Yu:
Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Informaticae 73(1-2): 237-264 (2006) - [j65]Arto Salomaa, Sheng Yu:
Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006) - [c46]Yuan Gao, Kai Salomaa, Sheng Yu:
State Complexity of Catenation and Reversal Combined with Star. DCFS 2006: 153-164 - [c45]Nicolae Santean, Sheng Yu:
On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167 - [c44]Sheng Yu:
On the State Complexity of Combined Operations. CIAA 2006: 11-22 - 2005
- [j64]Sheng Yu:
State Complexity: Recent Results and Open Problems. Fundam. Informaticae 64(1-4): 471-480 (2005) - [j63]Kai Salomaa, Sheng Yu:
Preface. Int. J. Found. Comput. Sci. 16(3): 399-401 (2005) - [j62]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005) - [c43]Lucian Ilie, Roberto Solis-Oba, Sheng Yu:
Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 - [c42]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Large NFA Without Mergeable States. DCFS 2005: 75-84 - [c41]Haitong Xu, Sheng Yu:
Adding States into Object Types. PLC 2005: 101-107 - [c40]Haitong Xu, Sheng Yu:
Type Theory and Language Constructs for Objects with States. DCM@ICALP 2005: 141-151 - 2004
- [j61]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) - [j60]Cezar Câmpeanu, Sheng Yu:
Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004) - [j59]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004) - [j58]Arto Salomaa, Derick Wood, Sheng Yu:
On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004) - [c39]Lucian Ilie, Gonzalo Navarro, Sheng Yu:
On NFA Reductions. Theory Is Forever 2004: 112-124 - [c38]Sheng Yu, Qing Zhao:
Process Traces With the Option Operation. PDPTA 2004: 750-755 - [e6]Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu:
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3317, Springer 2004, ISBN 3-540-24318-6 [contents] - 2003
- [j57]Lucian Ilie, Sheng Yu:
Follow automata. Inf. Comput. 186(1): 140-162 (2003) - [j56]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) - [j55]Lucian Ilie, Sheng Yu:
Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003) - [c37]Lucian Ilie, Sheng Yu, Qing Zhao:
Introduction to Process Traces. PDPTA 2003: 1706-1712 - [c36]Lucian Ilie, Baozhen Shan, Sheng Yu:
Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190 - 2002
- [j54]Alexandru Mateescu, Arto Salomaa, Sheng Yu:
Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002) - [j53]Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu:
On the robustness of primitive words. Discret. Appl. Math. 117(1-3): 239-252 (2002) - [j52]Sheng Yu:
State Complexity of Finite and Infinite Regular Languages. Bull. EATCS 76: 142-152 (2002) - [j51]Sheng Yu:
Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13(1): 1-3 (2002) - [j50]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): 83-97 (2002) - [j49]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): 303-310 (2002) - [j48]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): 117-118 (2002) - [j47]Cristian Calude, Kai Salomaa, Sheng Yu:
Additive Distances and Quasi-Distances Between Words. J. Univers. Comput. Sci. 8(2): 141-152 (2002) - [j46]Kai Salomaa, Sheng Yu:
Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002) - [c35]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. COCOON 2002: 320-329 - [c34]Lucian Ilie, Sheng Yu:
Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 - [c33]Lucian Ilie, Sheng Yu, Kaizhong Zhang:
Repetition Complexity of Words. DCFS 2002: 36 - [c32]Lucian Ilie, Sheng Yu:
Algorithms for Computing Small NFAs. MFCS 2002: 328-340 - [c31]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
Regex and Extended Regex. CIAA 2002: 77-84 - 2001
- [j45]Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
Tree-systems of morphisms. Acta Informatica 38(2): 131-153 (2001) - [j44]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
A sharpening of the Parikh mapping. RAIRO Theor. Informatics Appl. 35(6): 551-564 (2001) - [j43]Sheng Yu:
State Complexity of Regular Languages. J. Autom. Lang. Comb. 6(2): 221-234 (2001) - [j42]Markus Holzer, Kai Salomaa, Sheng Yu:
On the State Complexity of k-Entry Deterministic Finite Automata. J. Autom. Lang. Comb. 6(4): 453-466 (2001) - [j41]Sheng Yu:
Class-is-type is inadequate for object reuse. ACM SIGPLAN Notices 36(6): 50-59 (2001) - [j40]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001) - [c30]Sheng Yu:
The time dimension of computation models. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 161-172 - [c29]Michael Domaratzki, Jeffrey O. Shallit, Sheng Yu:
Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329 - [e5]Masami Ito, Gheorghe Paun, Sheng Yu:
Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin. World Scientific 2001, ISBN 981-02-4739-7 [contents] - [e4]Sheng Yu, Andrei Paun:
Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers. Lecture Notes in Computer Science 2088, Springer 2001, ISBN 3-540-42491-1 [contents] - 2000
- [j39]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
On Fairness of Many-Dimensional Trajectories. J. Autom. Lang. Comb. 5(2): 145-157 (2000) - [j38]Kai Salomaa, Xiuming Wu, Sheng Yu:
Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000) - [j37]Lila Kari, Greg Gloor, Sheng Yu:
Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000) - [j36]Kai Salomaa, Sheng Yu:
Alternating finite automata and star-free languages. Theor. Comput. Sci. 234(1-2): 167-176 (2000) - [c28]Andrei Paun, Nicolae Santean, Sheng Yu:
An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251 - [p2]Cezar Câmpeanu, Kai Salomaa, Sheng Yu:
State Complexity of Regular Languages: Finite versus Infinite. Finite Versus Infinite 2000: 53-73 - [e3]Arto Salomaa, Derick Wood, Sheng Yu:
A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific 2000, ISBN 981-02-4590-4 [contents]
1990 – 1999
- 1999
- [j35]Kai Salomaa, Sheng Yu:
Generalized Fairness and Context-Free Languages. Acta Cybern. 14(1): 193-203 (1999) - [j34]Gheorghe Paun, Sheng Yu:
On Synchronization in P Systems. Fundam. Informaticae 38(4): 397-410 (1999) - [j33]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): 385-400 (1999) - [j32]Kai Salomaa, Sheng Yu:
Synchronization Expressions and Languages. J. Univers. Comput. Sci. 5(9): 610-621 (1999) - [c27]Kai Salomaa, Sheng Yu:
Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56 - [c26]Arto Salomaa, Sheng Yu:
On the decomposition of finite languages. Developments in Language Theory 1999: 22-31 - [c25]Cristian Calude, Kai Salomaa, Sheng Yu:
Metric Lexical Analysis. WIA 1999: 48-59 - [c24]Cezar Câmpeanu, Karel Culík II, Kai Salomaa, Sheng Yu:
State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 - 1998
- [j31]Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu:
DNA Computing, Sticker Systems, and Universality. Acta Informatica 35(5): 401-420 (1998) - [j30]Kai Salomaa, Sheng Yu:
Synchronization Expressions with Extended Join Operation. Theor. Comput. Sci. 207(1): 73-88 (1998) - [c23]Lila Kari, Greg Gloor, Sheng Yu:
Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65 - [c22]Jin Ma, Sheng Yu:
Practical Rules for Reduction on the Number of States of a State Diagram. TOOLS (26) 1998: 46- - [c21]Cezar Câmpeanu, Nicolae Santean, Sheng Yu:
Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56 - [c20]Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu:
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81 - [e2]Derick Wood, Sheng Yu:
Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers. Lecture Notes in Computer Science 1436, Springer 1998, ISBN 3-540-64694-9 [contents] - 1997
- [j29]Cristian Calude, Sheng Yu:
Language-theoretic Complexity of Disjunctive Sequences. Discret. Appl. Math. 80(2-3): 203-209 (1997) - [j28]Kai Salomaa, Sheng Yu:
NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. J. Autom. Lang. Comb. 2(3): 177-186 (1997) - [c19]Kai Salomaa, Sheng Yu:
Rewriting Rules for Synchronization Languages. Structures in Logic and Computer Science 1997: 322-338 - [c18]Lila Kari, Gheorghe Paun, Gabriel Thierrin, Sheng Yu:
At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems. DNA Based Computers 1997: 329-346 - [c17]Alexandru Mateescu, Kai Salomaa, Sheng Yu:
Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364 - [c16]Kai Salomaa, Xiuming Wu, Sheng Yu:
Efficient Implementation of Regular Languages Using R-AFA. Workshop on Implementing Automata 1997: 176-184 - [p1]Sheng Yu:
Regular Languages. Handbook of Formal Languages (1) 1997: 41-110 - [e1]Darrell R. Raymond, Derick Wood, Sheng Yu:
Automata Implementation, First International Workshop on Implementing Automata, WIA '96, London, Ontario, Canada, August 29-31, 1996, Revised Papers. Lecture Notes in Computer Science 1260, Springer 1997, ISBN 3-540-63174-7 [contents] - 1996
- [j27]Lifu Guo, Kai Salomaa, Sheng Yu:
On Synchronization Languages. Fundam. Informaticae 25(3): 423-436 (1996) - [j26]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996) - [c15]Kai Salomaa, Sheng Yu:
EDTOL Structural Equivalence is Decidable. DMTCS 1996: 363-375 - [c14]Kai Salomaa, Sheng Yu:
NFA to DFA Transformation for Finite Languages. Workshop on Implementing Automata 1996: 149-158 - 1995
- [j25]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995) - [j24]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. RAIRO Theor. Informatics Appl. 29(6): 471-485 (1995) - [j23]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995) - [j22]Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu:
Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. Univers. Comput. Sci. 1(5): 292-311 (1995) - [c13]Kai Salomaa, Sheng Yu:
Nondeterminism Degrees for Context-Free Languages. Developments in Language Theory 1995: 154-165 - 1994
- [j21]Per Enflo, Andrew Granville, Jeffrey O. Shallit, Sheng Yu:
on Sparse Languages L such that LL = Sigma. Discret. Appl. Math. 52(3): 275-285 (1994) - [j20]Kai Salomaa, Derick Wood, Sheng Yu:
Pumping and Pushdown Machines. RAIRO Theor. Informatics Appl. 28(3-4): 221-232 (1994) - [j19]Kai Salomaa, Sheng Yu:
Measures of Nondeterminism for Pushdown Automata. J. Comput. Syst. Sci. 49(2): 362-374 (1994) - [j18]Sheng Yu, Qingyu Zhuang, Kai Salomaa:
The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994) - [j17]Helmut Jürgensen, Kai Salomaa, Sheng Yu:
Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994) - [c12]Kai Salomaa, Derick Wood, Sheng Yu:
Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385 - [c11]Kai Salomaa, Derick Wood, Sheng Yu:
Complexity of E0L Structural Equivalence. MFCS 1994: 587-596 - [c10]Lifu Guo, Kai Salomaa, Sheng Yu:
Synchronization expressions and languages. SPDP 1994: 257-264 - 1993
- [j16]Kai Salomaa, Sheng Yu:
Morphisms and rational tranducers. Bull. EATCS 50: 186-193 (1993) - [j15]Helmut Jürgensen, Kai Salomaa, Sheng Yu:
Decidability of the Intercode Property. J. Inf. Process. Cybern. 29(6): 375-380 (1993) - [c9]Kai Salomaa, Derick Wood, Sheng Yu:
Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439 - [c8]Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu:
Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312 - 1992
- [j14]R. Govindarajan, Sheng Yu, V. S. Lakshmanan:
Attempting guards in parallel: A data flow approach to execute generalized guarded commands. Int. J. Parallel Program. 21(4): 225-268 (1992) - [c7]Sheng Yu, Qingyu Zhuang, Kai Salomaa:
Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. ICCI 1992: 100-104 - [c6]Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey O. Shallit:
Characterizing Regular Languages with Polynomial Densities. MFCS 1992: 494-503 - [c5]Abdelaziz Fellah, Sheng Yu:
Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization. SAC 1992: 1159-1166 - 1991
- [j13]Karel Culík II, Sheng Yu:
Cellular automata, omegaomega-regular sets, and sofic systems. Discret. Appl. Math. 32(2): 85-101 (1991) - [j12]Arto Salomaa, Kai Salomaa, Sheng Yu:
Primary Types of Instances of the Post Correspondence Problem. Bull. EATCS 44: 226-241 (1991) - [j11]Sheng Yu, Qingyu Zhuang:
On the state complexity of intersection of regular languages. SIGACT News 22(3): 52-54 (1991) - [j10]Kai Salomaa, Sheng Yu:
Decidability of Structural Equivalence of E0L Grammars. Theor. Comput. Sci. 82(1): 131-139 (1991) - [c4]R. Govindarajan, Lifu Guo, Sheng Yu, P. Wang:
ParC project: practical constructs for parallel programming languages. COMPSAC 1991: 183-189 - [c3]Kai Salomaa, Sheng Yu:
Degrees of Nondeterminism for Pushdown Automata. FCT 1991: 380-389 - [c2]R. Govindarajan, Sheng Yu:
Data Flow Implementation of Generalized Guarded Commands. PARLE (1) 1991: 372-389 - 1990
- [j9]Abdelaziz Fellah, Helmut Jürgensen, Sheng Yu:
Constructions for alternating finite automata. Int. J. Comput. Math. 35(1-4): 117-132 (1990) - [j8]Kai Salomaa, Sheng Yu:
The Immortality Problem for LAG Systems. Inf. Process. Lett. 36(6): 311-315 (1990)
1980 – 1989
- 1989
- [j7]Karel Culík II, Jan K. Pachl, Sheng Yu:
On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989) - 1988
- [j6]Karel Culík II, Sheng Yu:
Undecidability of CA Classification Schemes. Complex Syst. 2(2) (1988) - [j5]Sheng Yu:
Can the catenation of two weakly sparse languages be dense? Discret. Appl. Math. 20(3): 265-267 (1988) - 1986
- [j4]Sheng Yu:
A property of real-time trellis automata. Discret. Appl. Math. 15(1): 117-119 (1986) - [j3]Efim B. Kinber, Arto Salomaa, Sheng Yu:
On the equivalence of grammars inferred from derivation. Bull. EATCS 29: 39-45 (1986) - [j2]Karel Culík II, Sheng Yu:
Real-Time, Pseudo Real-Time, and Linear-Time ITA. Theor. Comput. Sci. 47(3): 15-26 (1986) - 1985
- [c1]Karel Culík II, Sheng Yu:
Translation of Systolic Algorithms between Systems of Different Topology. ICPP 1985: 756-763 - 1984
- [j1]Karel Culík II, Sheng Yu:
Iterative Tree Automata. Theor. Comput. Sci. 32: 227-247 (1984)
Coauthor Index
[c62] [j93] [j86] [c58] [c54] [j80] [j77] [c53] [j76] [c49] [j71] [j68] [j67] [c47] [c46] [j63] [e6] [j56] [j49] [j48] [j47] [j46] [c31] [j44] [j42] [j39] [j38] [j36] [p2] [j35] [j32] [c27] [c25] [c24] [j30] [c20] [j28] [c19] [c17] [c16] [j27] [j26] [c15] [c14] [j25] [j24] [j23] [j22] [c13] [j20] [j19] [j18] [j17] [c12] [c11] [c10] [j16] [j15] [c9] [c8] [c7] [j12] [j10] [c3] [j8]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 20:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
