1 - 5 out of 5Page size: 10
  1. 2024

  2. Further q-reflections on the modulo 9 Kanade-Russell (conjectural) identities.

    Коненков, С. Д., 1 Aug 2024, In: Journal of Combinatorial Theory - Series A. 206, 25 p., 105894.

    Research output: Contribution to journal › Article › peer-review

  3. 2023

  4. On hardest languages for one-dimensional cellular automata

    Мрыхин, М. К. & Охотин, А. С., 1 Dec 2023, In: Information and Computation. 295, A, 17 p., 104891.

    Research output: Contribution to journal › Conference article › peer-review

  5. On the transformation of two-way finite automata to unambiguous finite automata

    Петров, С. А. & Охотин, А. С., 1 Dec 2023, In: Information and Computation. 295, A, 26 p., 104956.

    Research output: Contribution to journal › Conference article › peer-review

  6. The hardest language for grammars with context operators

    Мрыхин, М. К. & Охотин, А. С., 22 May 2023, In: Theoretical Computer Science. 958, 19 p., 113829.

    Research output: Contribution to journal › Article › peer-review

  7. The Hardest LL(k) Language

    Мрыхин, М. К. & Охотин, А. С., Apr 2023, In: International Journal of Foundations of Computer Science. 34, 2&3, p. 289-319 31 p.

    Research output: Contribution to journal › Article › peer-review

ID: 99408720