Works matching IS 01290541 AND DT 2020 AND VI 31 AND IP 5


Results: 8
    1
    2
    3

    Efficient Identification of k-Closed Strings.

    Published in:
    International Journal of Foundations of Computer Science, 2020, v. 31, n. 5, p. 595, doi. 10.1142/S0129054120500288
    By:
    • Alamro, Hayam;
    • Alzamel, Mai;
    • Iliopoulos, Costas S.;
    • Pissis, Solon P.;
    • Sung, Wing-Kin;
    • Watts, Steven
    Publication type:
    Article
    4

    A New Study of Parikh Matrices Restricted to Terms.

    Published in:
    International Journal of Foundations of Computer Science, 2020, v. 31, n. 5, p. 621, doi. 10.1142/S0129054120500306
    By:
    • Chern, Zi Jing;
    • Subramanian, K. G.;
    • Ahmad, Azhana;
    • Teh, Wen Chean
    Publication type:
    Article
    5
    6

    Weak Separation Problem for Tree Languages.

    Published in:
    International Journal of Foundations of Computer Science, 2020, v. 31, n. 5, p. 583, doi. 10.1142/S0129054120500276
    By:
    • Alirezazadeh, Saeid;
    • Alibabaei, Khadijeh
    Publication type:
    Article
    7
    8