1 - 10 out of 64Page 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. State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages

    Охотин, А. С. & Сажнева, Е. А., 2023, In: Journal of Automata, Languages and Combinatorics. 28, 1-3, p. 121-141 21 p.

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

  5. 2022

  6. Rational Index of Languages with Bounded Dimension of Parse Trees

    Shemetova, E., Okhotin, A. & Grigorev, S., May 2022, Developments in Language Theory - 26th International Conference, DLT 2022, Proceedings. Diekert, V. & Volkov, M. (eds.). Springer Nature, p. 263-273 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13257 LNCS).

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

  7. State complexity of GF(2)-operations on unary languages

    Okhotin, A. & Sazhneva, E., Mar 2022, In: Information and Computation. 284, 15 p., 104693.

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

  8. Formal languages over GF(2)

    Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A. & Sazhneva, E., 1 Feb 2022, In: Information and Computation. 283, 19 p., 104672.

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

  9. 2021

  10. State Complexity of Union and Intersection on Graph-Walking Automata

    Martynova, O. & Okhotin, A., 30 Dec 2021, Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Proceedings. Han, Y-S. & Ko, S-K. (eds.). Springer Nature, p. 125-136 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13037 LNCS).

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

  11. A Homological Casson Type Invariant of Knotoids

    Tarkaev, V., 1 Aug 2021, In: Results in Mathematics. 76, 3, 142.

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

  12. On the Length of Shortest Strings Accepted by Two-way Finite Automata

    Dobronravov, E., Dobronravov, N. & Okhotin, A., 30 Jun 2021, In: Fundamenta Informaticae. 180, 4, p. 315-331 17 p.

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

  13. Input-Driven Pushdown Automata on Well-Nested Infinite Strings

    Okhotin, A. & Selivanov, V. L., Jun 2021, Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings. Santhanam, R. & Musatov, D. (eds.). Springer Nature, p. 349-360 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12730 LNCS).

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

Previous 1 2 3 4 5 6 7 Next

ID: 45523572