Works matching IS 01290541 AND DT 2018 AND VI 29 AND IP 2

Results: 10
    1

    Diverse Palindromic Factorization is NP-Complete.

    Published in:
    International Journal of Foundations of Computer Science, 2018, v. 29, n. 2, p. 143, doi. 10.1142/S0129054118400014
    By:
    • Bannai, Hideo;
    • Gagie, Travis;
    • Inenaga, Shunsuke;
    • Kärkkäinen, Juha;
    • Kempa, Dominik;
    • Piątkowski, Marcin;
    • Sugimoto, Shiho
    Publication type:
    Article
    2

    Multi-Sequential Word Relations.

    Published in:
    International Journal of Foundations of Computer Science, 2018, v. 29, n. 2, p. 271, doi. 10.1142/S0129054118400075
    By:
    • Jecker, Ismaël;
    • Filiot, Emmanuel
    Publication type:
    Article
    3
    4
    5
    6
    7

    Preface.

    Published in:
    International Journal of Foundations of Computer Science, 2018, v. 29, n. 2, p. 139, doi. 10.1142/S0129054118010013
    By:
    • Potapov, Igor;
    • Semukhin, Pavel
    Publication type:
    Article
    8
    9

    Minimal Reversible Deterministic Finite Automata.

    Published in:
    International Journal of Foundations of Computer Science, 2018, v. 29, n. 2, p. 251, doi. 10.1142/S0129054118400063
    By:
    • Holzer, Markus;
    • Jakobi, Sebastian;
    • Kutrib, Martin
    Publication type:
    Article
    10