dblp.uni-trier.dewww.uni-trier.de

Sheng Yu Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
124EEHanlin Lu, Sheng Yu: Are Statecharts Finite Automata?. CIAA 2009: 258-261
123EEYo-Sub Han, Kai Salomaa, Sheng Yu: State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409
122EEYuan Gao, Sheng Yu: State Complexity Approximation CoRR abs/0907.5124: (2009)
121EEArto Salomaa, Kai Salomaa, Sheng Yu: Variants of codes and indecomposable languages. Inf. Comput. 207(11): 1340-1349 (2009)
120EEDaowen Qiu, Sheng Yu: Hierarchy and equivalence of multi-letter quantum finite automata. Theor. Comput. Sci. 410(30-32): 3006-3017 (2009)
119EEZoltán Ésik, Yuan Gao, Guangwu Liu, Sheng Yu: Estimation of state complexity of combined operations. Theor. Comput. Sci. 410(35): 3272-3280 (2009)
118EEKai Salomaa, Sheng Yu, Jinfeng Zan: Deciding determinism of caterpillar expressions. Theor. Comput. Sci. 410(37): 3438-3446 (2009)
2008
117EEArto Salomaa, Kai Salomaa, Sheng Yu: Length Codes, Products of Languages and Primality. LATA 2008: 476-486
116EEDaowen Qiu, Sheng Yu: Hierarchy and equivalence of multi-letter quantum finite automata CoRR abs/0812.0852: (2008)
115EEXiangfeng 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)
114EEYuan 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)
113EEGuangwu 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)
2007
112EEKai Salomaa, Sheng Yu, Jinfeng Zan: Deterministic Caterpillar Expressions. CIAA 2007: 97-108
111EEStavros Konstantinidis, Nicolae Santean, Sheng Yu: Representation and uniformization of algebraic transductions. Acta Inf. 43(6): 395-417 (2007)
110EEStavros Konstantinidis, Nicolae Santean, Sheng Yu: Fuzzification of Rational and Recognizable Sets. Fundam. Inform. 76(4): 413-447 (2007)
109EEKai Salomaa, Sheng Yu: On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007)
108EESheng Yu, Qing Zhao: Sc-Expressions in Object-Oriented Languages. Int. J. Found. Comput. Sci. 18(6): 1441-1452 (2007)
107 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)
106EEYo-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)
105EEArto Salomaa, Kai Salomaa, Sheng Yu: State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007)
2006
104EESheng Yu: On the State Complexity of Combined Operations. CIAA 2006: 11-22
103EENicolae Santean, Sheng Yu: On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167
102EEXiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao: Experiments Study for Scientific Texts Domain Keyword Acquisition. SKG 2006: 45
101EENicolae Santean, Sheng Yu: Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Inform. 73(1-2): 237-264 (2006)
100EEArto Salomaa, Sheng Yu: Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006)
2005
99EELucian Ilie, Roberto Solis-Oba, Sheng Yu: Reducing the Size of NFAs by Using Equivalences and Preorders. CPM 2005: 310-321
98 Haitong Xu, Sheng Yu: Adding States into Object Types. PLC 2005: 101-107
97EESheng Yu: State Complexity: Recent Results and Open Problems. Fundam. Inform. 64(1-4): 471-480 (2005)
96EEKai Salomaa, Sheng Yu: Preface. Int. J. Found. Comput. Sci. 16(3): 399-401 (2005)
95EECezar Câmpeanu, Nicolae Santean, Sheng Yu: Mergible states in large NFA. Theor. Comput. Sci. 330(1): 23-34 (2005)
2004
94 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 Springer 2004
93 Sheng Yu, Qing Zhao: Process Traces With the Option Operation. PDPTA 2004: 750-755
92EELucian Ilie, Gonzalo Navarro, Sheng Yu: On NFA Reductions. Theory Is Forever 2004: 112-124
91EECezar Câmpeanu, Sheng Yu: Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004)
90EELucian Ilie, Sheng Yu, Kaizhong Zhang: Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004)
89EEAlexandru Mateescu, Arto Salomaa, Sheng Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004)
88EEArto Salomaa, Derick Wood, Sheng Yu: On the state complexity of reversals of regular languages. Theor. Comput. Sci. 320(2-3): 315-329 (2004)
2003
87 Lucian Ilie, Sheng Yu, Qing Zhao: Introduction to Process Traces. PDPTA 2003: 1706-1712
86EELucian Ilie, Baozhen Shan, Sheng Yu: Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190
85EELucian Ilie, Sheng Yu: Follow automata. Inf. Comput. 186(1): 140-162 (2003)
84EECezar Câmpeanu, Kai Salomaa, Sheng Yu: A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003)
83EELucian Ilie, Sheng Yu: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003)
2002
82EECezar Câmpeanu, Kai Salomaa, Sheng Yu: Regex and Extended Regex. CIAA 2002: 77-84
81EELucian Ilie, Sheng Yu, Kaizhong Zhang: Repetition Complexity of Words. COCOON 2002: 320-329
80EELucian Ilie, Sheng Yu: Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288
79EELucian Ilie, Sheng Yu: Algorithms for Computing Small NFAs. MFCS 2002: 328-340
78EEAlexandru Mateescu, Arto Salomaa, Sheng Yu: Factorizations of Languages and Commutativity Conditions. Acta Cybern. 15(3): 339-351 (2002)
77 Sheng Yu: State Complexity of Finite and Infinite Regular Languages. Bulletin of the EATCS 76: 142-152 (2002)
76 Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, Sheng Yu: On the robustness of primitive words. Discrete Applied Mathematics 117(1-3): 239-252 (2002)
75EESheng Yu: Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13(1): 1-3 (2002)
74EECezar 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)
73EECristian 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)
72EECristian Calude, Kai Salomaa, Sheng Yu: Additive Distances and Quasi-Distances Between Words. J. UCS 8(2): 141-152 (2002)
71 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)
70EEKai Salomaa, Sheng Yu: Decidability of EDT0L structural equivalence. Theor. Comput. Sci. 276(1-2): 245-259 (2002)
2001
69 Sheng Yu, Andrei Paun: Implementation and Application of Automata, 5th International Conference, CIAA 2000, London, Ontario, Canada, July 24-25, 2000, Revised Papers Springer 2001
68 Masami Ito, Gheorghe Paun, Sheng Yu: Words, Semigroups, and Transductions - Festschrift in Honor of Gabriel Thierrin World Scientific 2001
67EEMichael Domaratzki, Jeffrey Shallit, Sheng Yu: Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329
66EEJürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu: Tree-systems of morphisms. Acta Inf. 38(2): 131-153 (2001)
65EEAlexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: A sharpening of the Parikh mapping. ITA 35(6): 551-564 (2001)
64 Sheng Yu: State Complexity of Regular Languages. Journal of Automata, Languages and Combinatorics 6(2): 221- (2001)
63 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)
62 Sheng Yu: Class-is-type is inadequate for object reuse. SIGPLAN Notices 36(6): 50-59 (2001)
61EECezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal cover-automata for finite languages. Theor. Comput. Sci. 267(1-2): 3-16 (2001)
2000
60 Arto Salomaa, Derick Wood, Sheng Yu: A Half-Century of Automata Theory: Celebration and Inspiration World Scientific 2000
59EEAndrei Paun, Nicolae Santean, Sheng Yu: An O(n2) Algorithm for Constructing Minimal Cover Automata for Finite Languages. CIAA 2000: 243-251
58 Alexandru Mateescu, Kai Salomaa, Sheng Yu: On Fairness of Many-Dimensional Trajectories. Journal of Automata, Languages and Combinatorics 5(2): 145-158 (2000)
57EEKai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000)
56EELila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000)
55EEKai Salomaa, Sheng Yu: Alternating finite automata and star-free languages. Theor. Comput. Sci. 234(1-2): 167-176 (2000)
1999
54 Arto Salomaa, Sheng Yu: On the decomposition of finite languages. Developments in Language Theory 1999: 22-31
53 Kai Salomaa, Sheng Yu: Synchronization Expressions: Characterization Results and Implementation. Jewels are Forever 1999: 45-56
52EECristian Calude, Kai Salomaa, Sheng Yu: Metric Lexical Analysis. WIA 1999: 48-59
51EECezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu: State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70
50EEKai Salomaa, Sheng Yu: Generalized Fairness and Context-Free Languages. Acta Cybern. 14(1): 193-204 (1999)
49 Gheorghe Paun, Sheng Yu: On Synchronization in P Systems. Fundam. Inform. 38(4): 397-410 (1999)
48 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)
47EEKai Salomaa, Sheng Yu: Synchronization Expressions and Languages. J. UCS 5(9): 610-621 (1999)
1998
46 Derick Wood, Sheng Yu: Automata Implementation, Second International Workshop on Implementing Automata, WIA '97, London, Ontario, Canada, September 18-20, 1997, Revised Papers Springer 1998
45 Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. MCU (1) 1998: 51-65
44EEJin Ma, Sheng Yu: Practical Rules for Reduction on the Number of States of a State Diagram. TOOLS (26) 1998: 46-
43EECezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56
42EESandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu: Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81
41EELila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998)
40EEKai Salomaa, Sheng Yu: Synchronization Expressions with Extended Join Operation. Theor. Comput. Sci. 207(1): 73-88 (1998)
1997
39 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 Springer 1997
38 Alexandru Mateescu, Kai Salomaa, Sheng Yu: Decidability of fairness for context-free languages. Developments in Language Theory 1997: 351-364
37 Kai Salomaa, Sheng Yu: Rewriting Rules for Synchronization Languages. Structures in Logic and Computer Science 1997: 322-338
36 Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using R-AFA. Workshop on Implementing Automata 1997: 176-184
35EECristian Calude, Sheng Yu: Language-theoretic Complexity of Disjunctive Sequences. Discrete Applied Mathematics 80(2-3): 203-209 (1997)
34 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)
1996
33 Kai Salomaa, Sheng Yu: NFA to DFA Transformation for Finite Languages. Workshop on Implementing Automata 1996: 149-158
32 L. Guo, Kai Salomaa, Sheng Yu: On Synchronization Languages. Fundam. Inform. 25(3): 423-436 (1996)
31EEKai Salomaa, Derick Wood, Sheng Yu: Structural Equivalence and ET0L Grammars. Theor. Comput. Sci. 164(1&2): 123-140 (1996)
1995
30 Kai Salomaa, Sheng Yu: Nondeterminism Degrees for Context-Free Languages. Developments in Language Theory 1995: 154-165
29 Kai Salomaa, Derick Wood, Sheng Yu: Complexity of E0L Structural Equivalence. ITA 29(6): 471-485 (1995)
28 Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: P, NP and the Post Correspondence Problem Inf. Comput. 121(2): 135-142 (1995)
27 Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Decision Problems for Patterns. J. Comput. Syst. Sci. 50(1): 53-63 (1995)
26EEAlexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. UCS 1(5): 292-311 (1995)
1994
25EEKai Salomaa, Derick Wood, Sheng Yu: Complexity of E0L Structural Equivalence. MFCS 1994: 587-596
24 Kai Salomaa, Derick Wood, Sheng Yu: Rediscovering Pushdown Machines. Results and Trends in Theoretical Computer Science 1994: 372-385
23EEPer Enflo, Andrew Granville, Jeffrey Shallit, Sheng Yu: on Sparse Languages L such that LL = Sigma. Discrete Applied Mathematics 52(3): 275-285 (1994)
22 Kai Salomaa, Derick Wood, Sheng Yu: Pumping and Pushdown Machines. ITA 28(3-4): 221-232 (1994)
21 Kai Salomaa, Sheng Yu: Measures of Nondeterminism for Pushdown Automata. J. Comput. Syst. Sci. 49(2): 362-374 (1994)
20 Sheng Yu, Qingyu Zhuang, Kai Salomaa: The State Complexities of Some Basic Operations on Regular Languages. Theor. Comput. Sci. 125(2): 315-328 (1994)
19 Helmut Jürgensen, Kai Salomaa, Sheng Yu: Transducers and the Decidability of Independence in Free Monoids. Theor. Comput. Sci. 134(1): 107-117 (1994)
1993
18 Kai Salomaa, Derick Wood, Sheng Yu: Structural Equivalences and ET0L Grammars (Extended Abstract). FCT 1993: 430-439
17EETao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu: Inclusion is Undecidable for Pattern Languages. ICALP 1993: 301-312
16 Kai Salomaa, Sheng Yu: Morphisms and rational tranducers. Bulletin of the EATCS 50: 186-193 (1993)
15 Helmut Jürgensen, Kai Salomaa, Sheng Yu: Decidability of the Intercode Property. Elektronische Informationsverarbeitung und Kybernetik 29(6): 375-380 (1993)
1992
14 Sheng Yu, Qingyu Zhuang, Kai Salomaa: Obtaining Tight Upper Bounds for the State Complexities of DFA Operations. ICCI 1992: 100-104
13EEAndrew Szilard, Sheng Yu, Kaizhong Zhang, Jeffrey Shallit: Characterizing Regular Languages with Polynomial Densities. MFCS 1992: 494-503
1991
12 Kai Salomaa, Sheng Yu: Degrees of Nondeterminism for Pushdown Automata. FCT 1991: 380-389
11EER. Govindarajan, Sheng Yu: Data Flow Implementation of Generalized Guarded Commands. PARLE (1) 1991: 372-389
10 Arto Salomaa, Kai Salomaa, Sheng Yu: Primary Types of Instances of the Post Correspondence Problem. Bulletin of the EATCS 44: 226-241 (1991)
9EEKarel Culik II, Sheng Yu: Cellular automata, omegaomega-regular sets, and sofic systems. Discrete Applied Mathematics 32(2): 85-101 (1991)
8 Kai Salomaa, Sheng Yu: Decidability of Structural Equivalence of E0L Grammars. Theor. Comput. Sci. 82(1): 131-139 (1991)
1990
7 Kai Salomaa, Sheng Yu: The Immortality Problem for LAG Systems. Inf. Process. Lett. 36(6): 311-315 (1990)
1989
6 Karel Culik II, Jan K. Pachl, Sheng Yu: On the Limit Sets of Cellular Automata. SIAM J. Comput. 18(4): 831-842 (1989)
1988
5EESheng Yu: Can the catenation of two weakly sparse languages be dense? Discrete Applied Mathematics 20(3): 265-267 (1988)
1986
4 Efim B. Kinber, Arto Salomaa, Sheng Yu: On the equivalence of grammars inferred from derivation. Bulletin of the EATCS 29: 39-45 (1986)
3 Karel Culik II, Sheng Yu: Real-Time, Pseudo Real-Time, and Linear-Time ITA. Theor. Comput. Sci. 47(3): 15-26 (1986)
1985
2 Karel Culik II, Sheng Yu: Translation of Systolic Algorithms between Systems of Different Topology. ICPP 1985: 756-763
1984
1 Karel Culik II, Sheng Yu: Iterative Tree Automata. Theor. Comput. Sci. 32: 227-247 (1984)

Coauthor Index

1Cristian S. Calude (Cristian Calude) [35] [52] [72] [73]
2Cezar Câmpeanu [43] [51] [61] [71] [74] [82] [84] [91] [95] [107]
3Karel Culik II [1] [2] [3] [6] [9] [51]
4Jürgen Dassow [66]
5Michael Domaratzki [67] [94]
6Per Enflo [23]
7Zoltán Ésik [119]
8Ning Fang [102] [115]
9Michelle Gaasenbeek [48]
10Yuan Gao [114] [119] [122]
11Greg Gloor [45] [48] [56]
12R. Govindarajan [11]
13Andrew Granville [23]
14L. Guo [32]
15Yo-Sub Han [106] [123]
16Markus Holzer [63]
17Sandra Huerter [42]
18Lucian Ilie [79] [80] [81] [83] [85] [86] [87] [90] [92] [99]
19Masami Ito [68]
20Tao Jiang [17] [27]
21Helmut Jürgensen [15] [19]
22Lila Kari (Lila Santean) [41] [45] [48] [56]
23Efim B. Kinber [4]
24Stavros Konstantinidis [110] [111]
25Guangwu Liu [113] [119]
26Hanlin Lu [124]
27Xiangfeng Luo [102] [115]
28Jin Ma [44]
29Carlos Martín-Vide [113]
30Alexandru Mateescu [26] [28] [38] [58] [65] [78] [89]
31Gonzalo Navarro [92]
32Alexander Okhotin [94]
33Jan K. Pachl [6]
34Andrei Paun [59] [69] [74]
35Gheorghe Paun [41] [49] [66] [68] [76]
36Daowen Qiu [116] [120]
37Darrell R. Raymond [39]
38Grzegorz Rozenberg [41]
39Arto Salomaa [4] [10] [17] [26] [27] [28] [41] [54] [60] [65] [78] [88] [89] [100] [105] [106] [113] [117] [121]
40Kai Salomaa [7] [8] [10] [12] [14] [15] [16] [17] [18] [19] [20] [21] [22] [24] [25] [26] [27] [28] [29] [30] [31] [32] [33] [34] [36] [37] [38] [40] [42] [47] [50] [51] [52] [53] [55] [57] [58] [63] [65] [70] [71] [72] [73] [82] [84] [94] [96] [105] [106] [109] [112] [114] [117] [118] [121] [123]
41Nicolae Santean [43] [59] [61] [76] [95] [101] [103] [107] [110] [111]
42Jeffrey Shallit [13] [23] [67]
43Baozhen Shan [86]
44Roberto Solis-Oba [99]
45Andrew Szilard [13]
46Gabriel Thierrin [66] [76]
47Derick Wood [18] [22] [24] [25] [29] [31] [39] [46] [60] [88] [106]
48Xiuming Wu [36] [42] [57]
49Huizhe Xiao [102] [115]
50Haitong Xu [98]
51Weimin Xu [102] [115]
52Kai Yan [102] [115]
53Jinfeng Zan [112] [118]
54Kaizhong Zhang [13] [81] [90]
55Qing Zhao [87] [93] [108]
56Qingyu Zhuang [14] [20]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)