| 2012 |
|---|
| 20 | In Memoriam Sheng Yu. Yuan Gao, Kai Salomaa. CIAA 2012, 1-4. Web SearchBibTeXDownload |
| 2011 |
|---|
| 19 | Transition Complexity of Incomplete DFAs. Yuan Gao, Kai Salomaa, Sheng Yu. Fundam. Inform. (110): 143-158 (2011). Web SearchBibTeXDownload |
| 2010 |
|---|
| 18 | Transition Complexity of Incomplete DFAs. Yuan Gao, Kai Salomaa, Sheng Yu. DCFS (abs/1008.1652): 99-109 (2010). Web SearchBibTeXDownload |
| 2009 |
|---|
| 17 | Operational State Complexity of Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Automata, Formal Languages, and Related Topics 2009, 99-115. Web SearchBibTeX |
| 16 | Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Fundam. Inform. (90): 93-106 (2009). Web SearchBibTeXDownload |
| 2008 |
|---|
| 15 | The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal. Yuan Gao, Kai Salomaa, Sheng Yu. Fundam. Inform. (83): 75-89 (2008). Web SearchBibTeXDownload |
| 2007 |
|---|
| 14 | Intercode Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Fundam. Inform. (76): 113-128 (2007). Web SearchBibTeXDownload |
| 13 | On the existence of prime decompositions. Yo-Sub Han, Arto Salomaa, Kai Salomaa, Derick Wood, Sheng Yu. Theor. Comput. Sci. (376): 60-69 (2007). Web SearchBibTeXDownload |
| 2006 |
|---|
| 12 | State Complexity of Catenation and Reversal Combined with Star. Yuan Gao, Kai Salomaa, Sheng Yu. DCFS 2006, 153-164. Web SearchBibTeX |
| 11 | State Complexity of Prefix-Free Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. DCFS 2006, 165-176. Web SearchBibTeX |
| 10 | Prime Decompositions of Regular Languages. Yo-Sub Han, Kai Salomaa, Derick Wood. Developments in Language Theory 2006, 145-155. Web SearchBibTeXDownload |
| 2004 |
|---|
| 9 | Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof. Kai Salomaa, Derick Wood. Theory Is Forever 2004, 259-267. Web SearchBibTeXDownload |
| 1996 |
|---|
| 8 | Structural Equivalence and ET0L Grammars. Kai Salomaa, Derick Wood, Sheng Yu. Theor. Comput. Sci. (164): 123-140 (1996). Web SearchBibTeXDownload |
| 1995 |
|---|
| 7 | Complexity of E0L Structural Equivalence. Kai Salomaa, Derick Wood, Sheng Yu. ITA (29): 471-485 (1995). Web SearchBibTeX |
| 6 | Decision Problems for Patterns. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu. J. Comput. Syst. Sci. (50): 53-63 (1995). Web SearchBibTeXDownload |
| 1994 |
|---|
| 5 | Pumping and Pushdown Machines. Kai Salomaa, Derick Wood, Sheng Yu. ITA (28): 221-232 (1994). Web SearchBibTeX |
| 4 | Complexity of E0L Structural Equivalence. Kai Salomaa, Derick Wood, Sheng Yu. MFCS 1994, 587-596. Web SearchBibTeXDownload |
| 3 | Rediscovering Pushdown Machines. Kai Salomaa, Derick Wood, Sheng Yu. Results and Trends in Theoretical Computer Science 1994, 372-385. Web SearchBibTeXDownload |
| 1993 |
|---|
| 2 | Structural Equivalences and ET0L Grammars (Extended Abstract). Kai Salomaa, Derick Wood, Sheng Yu. FCT 1993, 430-439. Web SearchBibTeXDownload |
| 1 | Inclusion is Undecidable for Pattern Languages. Tao Jiang, Arto Salomaa, Kai Salomaa, Sheng Yu. ICALP 1993, 301-312. Web SearchBibTeXDownload |
