2009 | ||
---|---|---|
118 | EE | Yo-Sub Han, Kai Salomaa, Sheng Yu: State Complexity of Combined Operations for Prefix-Free Regular Languages. LATA 2009: 398-409 |
2008 | ||
117 | EE | Arto Salomaa, Kai Salomaa, Sheng Yu: Length Codes, Products of Languages and Primality. LATA 2008: 476-486 |
116 | EE | Daowen Qiu, Sheng Yu: Hierarchy and equivalence of multi-letter quantum finite automata CoRR abs/0812.0852: (2008) |
115 | EE | 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) |
114 | EE | 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) |
113 | EE | 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) |
2007 | ||
112 | EE | Kai Salomaa, Sheng Yu, Jinfeng Zan: Deterministic Caterpillar Expressions. CIAA 2007: 97-108 |
111 | EE | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Representation and uniformization of algebraic transductions. Acta Inf. 43(6): 395-417 (2007) |
110 | EE | Stavros Konstantinidis, Nicolae Santean, Sheng Yu: Fuzzification of Rational and Recognizable Sets. Fundam. Inform. 76(4): 413-447 (2007) |
109 | EE | Kai Salomaa, Sheng Yu: On the State Complexity of Combined Operations and their Estimation. Int. J. Found. Comput. Sci. 18(4): 683-698 (2007) |
108 | EE | Sheng 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) | |
106 | EE | 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) |
105 | EE | Arto Salomaa, Kai Salomaa, Sheng Yu: State complexity of combined operations. Theor. Comput. Sci. 383(2-3): 140-152 (2007) |
2006 | ||
104 | EE | Sheng Yu: On the State Complexity of Combined Operations. CIAA 2006: 11-22 |
103 | EE | Nicolae Santean, Sheng Yu: On Weakly Ambiguous Finite Transducers. Developments in Language Theory 2006: 156-167 |
102 | EE | Xiangfeng Luo, Ning Fang, Weimin Xu, Sheng Yu, Kai Yan, Huizhe Xiao: Experiments Study for Scientific Texts Domain Keyword Acquisition. SKG 2006: 45 |
101 | EE | Nicolae Santean, Sheng Yu: Nondeterministic Bimachines and Rational Relations with Finite Codomain. Fundam. Inform. 73(1-2): 237-264 (2006) |
100 | EE | Arto Salomaa, Sheng Yu: Subword conditions and subword histories. Inf. Comput. 204(12): 1741-1755 (2006) |
2005 | ||
99 | EE | Lucian 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 | |
97 | EE | Sheng Yu: State Complexity: Recent Results and Open Problems. Fundam. Inform. 64(1-4): 471-480 (2005) |
96 | EE | Kai Salomaa, Sheng Yu: Preface. Int. J. Found. Comput. Sci. 16(3): 399-401 (2005) |
95 | EE | Cezar 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 | |
92 | EE | Lucian Ilie, Gonzalo Navarro, Sheng Yu: On NFA Reductions. Theory Is Forever 2004: 112-124 |
91 | EE | Cezar Câmpeanu, Sheng Yu: Pattern expressions and pattern automata. Inf. Process. Lett. 92(6): 267-274 (2004) |
90 | EE | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Word Complexity And Repetitions In Words. Int. J. Found. Comput. Sci. 15(1): 41-55 (2004) |
89 | EE | Alexandru Mateescu, Arto Salomaa, Sheng Yu: Subword histories and Parikh matrices. J. Comput. Syst. Sci. 68(1): 1-21 (2004) |
88 | EE | Arto 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 | |
86 | EE | Lucian Ilie, Baozhen Shan, Sheng Yu: Fast Algorithms for Extended Regular Expression Matching and Searching. STACS 2003: 179-190 |
85 | EE | Lucian Ilie, Sheng Yu: Follow automata. Inf. Comput. 186(1): 140-162 (2003) |
84 | EE | Cezar Câmpeanu, Kai Salomaa, Sheng Yu: A Formal Study Of Practical Regular Expressions. Int. J. Found. Comput. Sci. 14(6): 1007-1018 (2003) |
83 | EE | Lucian Ilie, Sheng Yu: Reducing NFAs by invariant equivalences. Theor. Comput. Sci. 306(1-3): 373-390 (2003) |
2002 | ||
82 | EE | Cezar Câmpeanu, Kai Salomaa, Sheng Yu: Regex and Extended Regex. CIAA 2002: 77-84 |
81 | EE | Lucian Ilie, Sheng Yu, Kaizhong Zhang: Repetition Complexity of Words. COCOON 2002: 320-329 |
80 | EE | Lucian Ilie, Sheng Yu: Constructing NFA s by Optimal Use of Positions in Regular Expressions. CPM 2002: 279-288 |
79 | EE | Lucian Ilie, Sheng Yu: Algorithms for Computing Small NFAs. MFCS 2002: 328-340 |
78 | EE | Alexandru 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) | |
75 | EE | Sheng Yu: Implementation and Application of Automata - Editor's Foreword. Int. J. Found. Comput. Sci. 13(1): 1-3 (2002) |
74 | EE | 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) |
73 | EE | 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) |
72 | EE | Cristian 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) | |
70 | EE | Kai 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 | |
67 | EE | Michael Domaratzki, Jeffrey Shallit, Sheng Yu: Minimal Covers of Formal Languages. Developments in Language Theory 2001: 319-329 |
66 | EE | Jürgen Dassow, Gheorghe Paun, Gabriel Thierrin, Sheng Yu: Tree-systems of morphisms. Acta Inf. 38(2): 131-153 (2001) |
65 | EE | Alexandru 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) | |
61 | EE | Cezar 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 | |
59 | EE | Andrei 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) | |
57 | EE | Kai Salomaa, Xiuming Wu, Sheng Yu: Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata. Theor. Comput. Sci. 231(1): 103-111 (2000) |
56 | EE | Lila Kari, Greg Gloor, Sheng Yu: Using DNA to solve the Bounded Post Correspondence Problem. Theor. Comput. Sci. 231(2): 193-203 (2000) |
55 | EE | Kai 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 | |
52 | EE | Cristian Calude, Kai Salomaa, Sheng Yu: Metric Lexical Analysis. WIA 1999: 48-59 |
51 | EE | Cezar Câmpeanu, Karel Culik II, Kai Salomaa, Sheng Yu: State Complexity of Basic Operations on Finite Languages. WIA 1999: 60-70 |
50 | EE | Kai 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) | |
47 | EE | Kai 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 | |
44 | EE | Jin Ma, Sheng Yu: Practical Rules for Reduction on the Number of States of a State Diagram. TOOLS (26) 1998: 46- |
43 | EE | Cezar Câmpeanu, Nicolae Santean, Sheng Yu: Minimal Cover-Automata for Finite Languages. Workshop on Implementing Automata 1998: 43-56 |
42 | EE | Sandra Huerter, Kai Salomaa, Xiuming Wu, Sheng Yu: Implementing Reversed Alternating Finite Automaton (r-AFA) Operations. Workshop on Implementing Automata 1998: 69-81 |
41 | EE | Lila Kari, Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa, Sheng Yu: DNA Computing, Sticker Systems, and Universality. Acta Inf. 35(5): 401-420 (1998) |
40 | EE | Kai 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 | |
35 | EE | Cristian 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) | |
31 | EE | Kai 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) | |
26 | EE | Alexandru Mateescu, Arto Salomaa, Kai Salomaa, Sheng Yu: Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model. J. UCS 1(5): 292-311 (1995) |
1994 | ||
25 | Kai 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 | |
23 | EE | Per 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 | |
17 | Tao 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 | |
13 | Andrew 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 | |
11 | R. 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) | |
9 | EE | Karel 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 | ||
5 | EE | Sheng 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) |