1 - 9 out of 9Page size: 10
  1. 2025

  2. Two 2/5-level mock theta conjecture-like identities

    Коненков, С. Д. & Мортенсон, Э. Т., Dec 2025, In: Research in Number Theory. 11, 4, 93.

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

  3. Subgroups Generated by a Pair of 2-Tori in $\operatorname{GL}(4,K)$, II

    Нестеров, В. В. & Чжан, М., 18 Sep 2025, In: Vladikavkaz Mathematical Journal. 27, 3, p. 101-119 19 p.

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

  4. On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata

    Петров, С. А. & Охотин, А. С., 16 Aug 2025, Developments in Language Theory: 29th International Conference, DLT 2025, Seoul, South Korea, August 19–22, 2025, Proceedings. Ko, S-K. & Manea, F. (eds.). Springer Nature, p. 107–122 16 p. (Lecture Notes in Computer Science; vol. 16036 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  5. 2024

  6. 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

  7. Subgroups generated by a pair of 2-tori in GL(4,K). I

    Нестеров, В. В. & Чжан, М., 2024, In: ЗАПИСКИ НАУЧНЫХ СЕМИНАРОВ САНКТ-ПЕТЕРБУРГСКОГО ОТДЕЛЕНИЯ МАТЕМАТИЧЕСКОГО ИНСТИТУТА ИМ. В.А. СТЕКЛОВА РАН. 531, p. 127-146 20 p.

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

  8. 2023

  9. 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

  10. 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

  11. 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

  12. 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