AAAAAA

   
Results: 1-9 |
Results: 9

Authors: ILIE L SALOMAA A
Citation: L. Ilie et A. Salomaa, ON WELL QUASI ORDERS OF FREE MONOIDS, Theoretical computer science, 204(1-2), 1998, pp. 131-152

Authors: HARJU T ILIE L
Citation: T. Harju et L. Ilie, ON QUASI ORDERS OF WORDS AND THE CONFLUENCE PROPERTY, Theoretical computer science, 200(1-2), 1998, pp. 205-224

Authors: ILIE L SALOMAA A
Citation: L. Ilie et A. Salomaa, 2-TESTABILITY AND RELABELINGS PRODUCE EVERYTHING, Journal of computer and system sciences (Print), 56(3), 1998, pp. 253-262

Authors: HARJU T ILIE L
Citation: T. Harju et L. Ilie, LANGUAGES OBTAINED FROM INFINITE WORDS, Informatique theorique et applications, 31(5), 1997, pp. 445-455

Authors: ILIE L
Citation: L. Ilie, ON COMPUTATIONAL-COMPLEXITY OF CONTEXTUAL LANGUAGES, Theoretical computer science, 183(1), 1997, pp. 33-44

Authors: HALAVA V HARJU T ILIE L
Citation: V. Halava et al., ON A GEOMETRIC PROBLEM OF ZIGZAGS, Information processing letters, 62(1), 1997, pp. 1-4

Authors: ILIE L MITRANA V
Citation: L. Ilie et V. Mitrana, BINARY SELF-ADDING SEQUENCES AND LANGUAGES, International journal of computer mathematics, 62(3-4), 1996, pp. 171-181

Authors: ILIE L
Citation: L. Ilie, ON SUBWORDS OF INFINITE WORDS, Discrete applied mathematics, 63(3), 1995, pp. 277-279

Authors: ILIE L
Citation: L. Ilie, ON A CONJECTURE ABOUT SLENDER CONTEXT-FREE LANGUAGES, Theoretical computer science, 132(1-2), 1994, pp. 427-434
Risultati: 1-9 |