- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j93 |      | Yuan Gao, Sheng Yu: State Complexity of Combined Operations with Union, Intersection, Star and Reversal. Fundam. Inform. 116(1-4): 79-92 (2012) |
| j92 | | 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) |
| j91 | | Yuan Gao, Sheng Yu: State Complexity and Approximation. Int. J. Found. Comput. Sci. 23(5): 1085-1098 (2012) |
| j90 | | Sheng Yu, Prudence W. H. Wong: A note on "An optimal online algorithm for single machine scheduling to minimize total general completion time". Inf. Process. Lett. 112(1-2): 55-58 (2012) |
| j89 | | Sheng Yu, Damon Berry, Jesus Bisbal: Clinical coverage of an archetype repository over SNOMED-CT. Journal of Biomedical Informatics 45(3): 408-418 (2012) |
| j88 | | 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) |
| j87 | | Bo Cui, Yuan Gao, Lila Kari, Sheng Yu: State complexity of combined operations with two basic operations. Theor. Comput. Sci. 437: 82-102 (2012) |
| j86 | | 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) |
| c60 | | Haiming Chen, Sheng Yu: Derivatives of Regular Expressions and an Application. Computation, Physics and Beyond 2012: 343-356 |
| c59 | | Sheng Yu, Jude-Thaddeus Ojiaku, Prudence W. H. Wong, Yinfeng Xu: Online Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines. TAMC 2012: 260-272 |
| i5 | | |
| i4 | | Sheng Yu, Subhash Kak: An Empirical Study of How Users Adopt Famous Entities. CoRR abs/1209.1323 (2012) |
| 2011 | ||
| j85 | | Yuan Gao, Kai Salomaa, Sheng Yu: Transition Complexity of Incomplete DFAs. Fundam. Inform. 110(1-4): 143-158 (2011) |
| j84 | | |
| j83 | | 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) |
| j82 | | Sheng Yu, Shijie Zhou, Leyuan Liu, Rui Yang, Jiaqing Luo: Detecting Malware Variants by Byte Frequency. JNW 6(4): 638-645 (2011) |
| j81 | | Jie-xian Zeng, Sheng Yu, Xiang Fu, Chao-xia Li: A Line Segments Matching Method based on Epipolar-line Constraint and Line Segment Features. JSW 6(9): 1746-1754 (2011) |
| c58 | | Sheng Yu, Damon Berry, Jesús Bisbal: Performance analysis and assessment of a tf-idf based archetype-SNOMED-CT binding algorithm. CBMS 2011: 1-6 |
| c57 | | Sheng Yu, Yinfeng Xu, Ming Liu, Feifeng Zheng: Optimal Policy for Single-Machine Scheduling with Deterioration Effects, Learning Effects, Setup Times, and Availability Constraints. COCOA 2011: 64-73 |
| c56 | | |
| c55 | | Sheng Yu, Yuan Gao: State Complexity Research and Approximation. Developments in Language Theory 2011: 46-57 |
| c54 | | Arto Salomaa, Kai Salomaa, Sheng Yu: Undecidability of the State Complexity of Composed Regular Operations. LATA 2011: 489-498 |
| c53 | | |
| 2010 | ||
| j80 | | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: On implementing recognizable transductions. Int. J. Comput. Math. 87(2): 260-277 (2010) |
| j79 | | Arto Salomaa, Sheng Yu: Subword Occurrences, Parikh Matrices and Lyndon Images. Int. J. Found. Comput. Sci. 21(1): 91-111 (2010) |
| j78 | | Helmut Jürgensen, Hermann A. Maurer, Arto Salomaa, Sheng Yu: Seventy Years Derick Wood. J. UCS 16(5): 577-585 (2010) |
| c52 | | Sheng Yu, Shijie Zhou, Sha Wang: Fast-flux attack network identification based on agent lifespan. WCNIS 2010: 658-662 |
| c51 | | |
| c50 | | |
| c49 | | |
| e7 | | Yuan Gao, Hanlin Lu, Shinnosuke Seki, Sheng Yu (Eds.): 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 |
| 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) |
| 2009 | ||
| j77 | | Arto Salomaa, Kai Salomaa, Sheng Yu: Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009) |
| j76 | | Daowen Qiu, Sheng Yu: Hierarchy and equivalence of multi-letter quantum finite automata. Theor. Comput. Sci. 410(30-32): 3006-3017 (2009) |
| j75 | | Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009) |
| j74 | | Kai Salomaa, Sheng Yu, Jinfeng Zan: Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410(37): 3438-3446 (2009) |
| c48 | | Yo-Sub Han, Kai Salomaa, Sheng Yu: State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409 |
| c47 | | |
| c46 | | |
| 2008 | ||
| j73 | | Xiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao: Experimental study on the extraction and distribution of textual domain keywords. Concurrency and Computation: Practice and Experience 20(16): 1917-1932 (2008) |
| j72 | | Yuan Gao, Kai Salomaa, Sheng Yu: The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Fundam. Inform. 83(1-2): 75-89 (2008) |
| j71 | | 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) |
| c45 |  | Zoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of State Complexity of Combined Operations. DCFS 2008: 168-181 |
| c44 | | 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 | ||
| j70 | | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Representation and uniformization of algebraic transductions. Acta Inf. 43(6): 395-417 (2007) |
| j69 | | |
| j68 | | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Fuzzification of Rational and Recognizable Sets. Fundam. Inform. 76(4): 413-447 (2007) |
| j67 | | Kai Salomaa, Sheng Yu: On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007) |
| j66 | | Sheng Yu, Qing Zhao: Sc-Expressions in Object-Oriented Languages. Int. J. Found. Comput. Sci. 18(6): 1441-1452 (2007) |
| j65 | | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: A Family of NFAs Free of State Reductions. Journal of Automata, Languages and Combinatorics 12(1-2): 69-78 (2007) |
| j64 | | 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) |
| j63 | | Arto Salomaa, Kai Salomaa, Sheng Yu: State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007) |
| c43 | | Guangwu Liu, Carlos Martín-Vide, Arto Salomaa, Sheng Yu: State Complexity of Basic Operations Combined with Reversal. LATA 2007: 355-366 |
| c42 | | |
| 2006 | ||
| j62 | | Nicolae Santean, Sheng Yu: Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Inform. 73(1-2): 237-264 (2006) |
| j61 | | Arto Salomaa, Sheng Yu: Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006) |
| c41 | | Yuan Gao, Kai Salomaa, Sheng Yu: State Complexity of Catenation and Reversal Combined with Star. DCFS 2006: 153-164 |
| c40 | | Nicolae Santean, Sheng Yu: On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167 |
| c39 | | Xiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao: Experiments Study for Scientific Texts Domain Keyword Acquisition. SKG 2006: 45 |
| c38 | | |
| 2005 | ||
| j60 | | Sheng Yu: State Complexity: Recent Results and Open Problems. Fundam. Inform. 64(1-4): 471-480 (2005) |
| j59 | | |
| j58 | | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005) |
| c37 | | Lucian Ilie, Roberto Solis-Oba, Sheng Yu: Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321 |
| c36 | | |
| c35 | | |
| 2004 | ||
| j57 | | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) |
| j56 | | Cezar Câmpeanu, Sheng Yu: Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004) |
| j55 | | Alexandru Mateescu, Arto Salomaa, Sheng Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004) |
| j54 | | Arto Salomaa, Derick Wood, Sheng Yu: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004) |
| c34 | | |
| c33 | | |
| e6 | | Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (Eds.): 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 |
| 2003 | ||
| j53 | | |
| j52 | | Cezar Câmpeanu, Kai Salomaa, Sheng Yu: A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) |
| j51 | | Lucian Ilie, Sheng Yu: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003) |
| c32 | | |
| c31 | | Lucian Ilie, Baozhen Shan, Sheng Yu: Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190 |
| 2002 | ||
| j50 | | Alexandru Mateescu, Arto Salomaa, Sheng Yu: Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002) |
| j49 | | Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu: On the robustness of primitive words. Discrete Applied Mathematics 117(1-3): 239-252 (2002) |
| j48 | | Sheng Yu: State Complexity of Finite and Infinite Regular Languages. Bulletin of the EATCS 76: 142-152 (2002) |
| j47 | | Sheng Yu: Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13(1): 1-3 (2002) |
| j46 | | 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) |
| j45 | | Cezar Câmpeanu, Kai Salomaa, Sheng Yu: Tight Lower Bound for the State Complexity of Shuffle of Regular Languages. Journal of Automata, Languages and Combinatorics 7(3): 303-310 (2002) |
| j44 | | 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. UCS 8(2): 117-118 (2002) |
| j43 | | Cristian Calude, Kai Salomaa, Sheng Yu: Additive Distances and Quasi-Distances Between Words. J. UCS 8(2): 141-152 (2002) |
| j42 | | Kai Salomaa, Sheng Yu: Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002) |
| c30 | | |
| c29 | | Lucian Ilie, Sheng Yu: Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 |
| c28 | | |
| c27 | | |
| c26 | | |
| 2001 | ||
| j41 | | Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu: Tree-systems of morphisms. Acta Inf. 38(2): 131-153 (2001) |
| j40 | | Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: A sharpening of the Parikh mapping. ITA 35(6): 551-564 (2001) |
| j39 | | Sheng Yu: State Complexity of Regular Languages. Journal of Automata, Languages and Combinatorics 6(2): 221- (2001) |
| j38 | | Markus Holzer, Kai Salomaa, Sheng Yu: On the State Complexity of k-Entry Deterministic Finite Automata. Journal of Automata, Languages and Combinatorics 6(4): 453-466 (2001) |
| j37 | | |
| j36 | | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001) |
| c25 | | Sheng Yu: The time dimension of computation models. Where Mathematics, Computer Science, Linguistics and Biology Meet 2001: 161-172 |
| c24 | | Michael Domaratzki, Jeffrey Shallit, Sheng Yu: Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329 |
| e5 | | Masami Ito, Gheorghe Paun, Sheng Yu (Eds.): Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin. World Scientific 2001, isbn 981-02-4739-7 |
| e4 | | Sheng Yu, Andrei Paun (Eds.): 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 |
| 2000 | ||
| j35 | | Alexandru Mateescu, Kai Salomaa, Sheng Yu: On Fairness of Many-Dimensional Trajectories. Journal of Automata, Languages and Combinatorics 5(2): 145-158 (2000) |
| j34 | | Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000) |
| j33 | | Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000) |
| j32 | | Kai Salomaa, Sheng Yu: Alternating finite automata and star-free languages. Theor. Comput. Sci. 234(1-2): 167-176 (2000) |
| c23 | | Andrei Paun, Nicolae Santean, Sheng Yu: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251 |
| e3 | | Arto Salomaa, Derick Wood, Sheng Yu (Eds.): A Half-Century of Automata Theory: Celebration and Inspiration. World Scientific 2000, isbn 981-02-4590-4 |
| 1999 | ||
| j31 | | Kai Salomaa, Sheng Yu: Generalized Fairness and Context-Free Languages. Acta Cybern. 14(1): 193-204 (1999) |
| j30 | | |
| j29 | | Greg Gloor, Lila Kari, Michelle Gaasenbeek, Sheng Yu: Towards a DNA Solution to the Shortest Common Superstring Problem. International Journal on Artificial Intelligence Tools 8(4): 385-400 (1999) |
| j28 | | |
| c22 | | Kai Salomaa, Sheng Yu: Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56 |
| c21 | | Arto Salomaa, Sheng Yu: On the decomposition of finite languages. Developments in Language Theory 1999: 22-31 |
| c20 | | |
| c19 | | Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu: State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 |
| 1998 | ||
| j27 | | Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998) |
| j26 | | Kai Salomaa, Sheng Yu: Synchronization Expressions with Extended Join Operation. Theor. Comput. Sci. 207(1): 73-88 (1998) |
| c18 | | Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65 |
| c17 | | Jin Ma, Sheng Yu: Practical Rules for Reduction on the Number of States of a State Diagram. TOOLS (26) 1998: 46- |
| c16 | | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56 |
| c15 | | 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 (Eds.): 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 |
| 1997 | ||
| j25 | | Cristian Calude, Sheng Yu: Language-theoretic Complexity of Disjunctive Sequences. Discrete Applied Mathematics 80(2-3): 203-209 (1997) |
| j24 | | Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets. Journal of Automata, Languages and Combinatorics 2(3): 177-186 (1997) |
| c14 | | Kai Salomaa, Sheng Yu: Rewriting Rules for Synchronization Languages. Structures in Logic and Computer Science 1997: 322-338 |
| c13 | | Alexandru Mateescu, Kai Salomaa, Sheng Yu: Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364 |
| c12 | | Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using R-AFA. Workshop on Implementing Automata 1997: 176-184 |
| e1 | | Darrell R. Raymond, Derick Wood, Sheng Yu (Eds.): 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 |
| 1996 | ||
| j23 | | |
| j22 | | Kai Salomaa, Derick Wood, Sheng Yu: Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996) |
| c11 | | Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages. Workshop on Implementing Automata 1996: 149-158 |
| 1995 | ||
| j21 | | Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: P, NP and the Post Correspondence Problem. Inf. Comput. 121(2): 135-142 (1995) |
| j20 | | Kai Salomaa, Derick Wood, Sheng Yu: Complexity of E0L Structural Equivalence. ITA 29(6): 471-485 (1995) |
| j19 | | Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995) |
| j18 | | Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. UCS 1(5): 292-311 (1995) |
| c10 | | Kai Salomaa, Sheng Yu: Nondeterminism Degrees for Context-Free Languages. Developments in Language Theory 1995: 154-165 |
| 1994 | ||
| j17 | | Per Enflo, Andrew Granville, Jeffrey Shallit, Sheng Yu: on Sparse Languages L such that LL = Sigma. Discrete Applied Mathematics 52(3): 275-285 (1994) |
| j16 | | |
| j15 | | Kai Salomaa, Sheng Yu: Measures of Nondeterminism for Pushdown Automata. J. Comput. Syst. Sci. 49(2): 362-374 (1994) |
| j14 | | Sheng Yu, Qingyu Zhuang, Kai Salomaa: The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994) |
| j13 | | Helmut Jürgensen, Kai Salomaa, Sheng Yu: Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994) |
| c9 | | Kai Salomaa, Derick Wood, Sheng Yu: Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385 |
| c8 | | |
| 1993 | ||
| j12 | | |
| j11 | | Helmut Jürgensen, Kai Salomaa, Sheng Yu: Decidability of the Intercode Property. Elektronische Informationsverarbeitung und Kybernetik 29(6): 375-380 (1993) |
| c7 | | Kai Salomaa, Derick Wood, Sheng Yu: Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439 |
| c6 | | Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312 |
| 1992 | ||
| j10 | | R. Govindarajan, Sheng Yu, V. S. Lakshmanan: Attempting guards in parallel: A data flow approach to execute generalized guarded commands. International Journal of Parallel Programming 21(4): 225-268 (1992) |
| c5 | | Sheng Yu, Qingyu Zhuang, Kai Salomaa: Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. ICCI 1992: 100-104 |
| c4 | | Andrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit: Characterizing Regular Languages with Polynomial Densities. MFCS 1992: 494-503 |
| 1991 | ||
| j9 | | Karel Culik II, Sheng Yu: Cellular automata, omegaomega-regular sets, and sofic systems. Discrete Applied Mathematics 32(2): 85-101 (1991) |
| j8 | | Arto Salomaa, Kai Salomaa, Sheng Yu: Primary Types of Instances of the Post Correspondence Problem. Bulletin of the EATCS 44: 226-241 (1991) |
| j7 | | Kai Salomaa, Sheng Yu: Decidability of Structural Equivalence of E0L Grammars. Theor. Comput. Sci. 82(1): 131-139 (1991) |
| c3 | | |
| c2 | | R. Govindarajan, Sheng Yu: Data Flow Implementation of Generalized Guarded Commands. PARLE (1) 1991: 372-389 |
| 1990 | ||
| j6 | | Kai Salomaa, Sheng Yu: The Immortality Problem for LAG Systems. Inf. Process. Lett. 36(6): 311-315 (1990) |
| 1989 | ||
| j5 | | Karel Culik II, Jan K. Pachl, Sheng Yu: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989) |
| 1988 | ||
| j4 | | Sheng Yu: Can the catenation of two weakly sparse languages be dense? Discrete Applied Mathematics 20(3): 265-267 (1988) |
| 1986 | ||
| j3 | | Efim B. Kinber, Arto Salomaa, Sheng Yu: On the equivalence of grammars inferred from derivation. Bulletin of the EATCS 29: 39-45 (1986) |
| j2 | | Karel Culik II, Sheng Yu: Real-Time, Pseudo Real-Time, and Linear-Time ITA. Theor. Comput. Sci. 47(3): 15-26 (1986) |
| 1985 | ||
| c1 | | Karel Culik II, Sheng Yu: Translation of Systolic Algorithms between Systems of Different Topology. ICPP 1985: 756-763 |
| 1984 | ||
| j1 | | |
Colors in the list of coauthors
Last update Sat May 18 11:20:32 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page