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

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

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

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

  5. 2021

  6. On Hardest Languages for One-Dimensional Cellular Automata

    Mrykhin, M. & Okhotin, A., Feb 2021, Language and Automata Theory and Applications - 15th International Conference, LATA 2021, Proceedings. Leporati, A., Martín-Vide, C., Shapira, D. & Zandron, C. (eds.). Springer Nature, p. 118-130 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12638 LNCS).

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

  7. The Hardest LL(k) Language

    Mrykhin, M. & Okhotin, A., 2021, Developments in Language Theory - 25th International Conference, DLT 2021, Proceedings. Moreira, N. & Reis, R. (eds.). Springer Nature, p. 304-315 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12811 LNCS).

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

ID: 18610900