| 2007 |
|---|
| 12 | EE | Stepan Holub,
Juha Kortelainen:
On systems of word equations with simple loop sets.
Theor. Comput. Sci. 380(3): 363-372 (2007) |
| 2005 |
|---|
| 11 | EE | Juha Kortelainen:
Polynomial Generators of Recursively Enumerable Languages.
Developments in Language Theory 2005: 320-326 |
| 2001 |
|---|
| 10 | EE | Stepan Holub,
Juha Kortelainen:
Linear size test sets for certain commutative languages.
ITA 35(5): 453-475 (2001) |
| 1999 |
|---|
| 9 | EE | Ismo Hakala,
Juha Kortelainen:
On the System of Word Equations x0ui1x1ui2x2ui3x3=y0vi1y1vi2y2vi3y3(i=0, 1, 2, ...) in a Free Monoid.
Theor. Comput. Sci. 225(1-2): 149-161 (1999) |
| 1998 |
|---|
| 8 | | Juha Kortelainen:
Remarks about Commutative Context-Free Languages.
J. Comput. Syst. Sci. 56(1): 125-129 (1998) |
| 7 | | Juha Kortelainen:
On the System of Word Equations x0u1ix1u2ix2 ... umixm = y0v1iy1v2iy2 ... vniyn (i=0, 1, 2, ...) in a Free Monoid.
Journal of Automata, Languages and Combinatorics 3(1): 43-58 (1998) |
| 1997 |
|---|
| 6 | | Ismo Hakala,
Juha Kortelainen:
On the System of word equations x^i_1 x^i_2 ... x^i_m = y^i_1 y^i_2 ...y^i_n (i=1, 2, ...) in a Free Monoid.
Acta Inf. 34(3): 217-230 (1997) |
| 5 | | Ismo Hakala,
Juha Kortelainen:
Polynomial Size Test Sets for Commutative Languages.
ITA 31(3): 291-304 (1997) |
| 1989 |
|---|
| 4 | EE | Juha Kortelainen:
The conjecture of Fliess on commutative context-free languages.
J. ACM 36(4): 870-872 (1989) |
| 1986 |
|---|
| 3 | | Juha Kortelainen:
Every Commutative Quasirational Language is Regular.
ITA 20(3): 319-337 (1986) |
| 1985 |
|---|
| 2 | | Juha Kortelainen:
Every Commutative Quasirational Language is Regular.
ICALP 1985: 348-355 |
| 1981 |
|---|
| 1 | | Juha Kortelainen:
Some Properties of Language Families Generated by Commutative Languages.
FCT 1981: 210-217 |
