41 - 50 out of 201Page size: 10
  1. 2021

  2. 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 › Research › peer-review

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

  4. 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 › Research › peer-review

  5. Lower bounds for graph-walking automata

    Martynova, O. & Okhotin, A., 1 Mar 2021, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Blaser, M. & Monmege, B. (eds.). Dagstuhl Publishing, 13 p. 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 187).

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

  6. Computational and Proof Complexity of Partial String Avoidability

    Itsykson, D., Okhotin, A. & Oparin, V., Mar 2021, In: ACM Transactions on Computation Theory. 13, 1, 25 p., 3442365.

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

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

  8. On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata

    Петров, С. А. & 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. 81-93 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

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

  10. 2020

  11. Rational index of bounded-oscillation languages

    Shemetova, E., Okhotin, A. & Grigorev, S., 7 Dec 2020.

    Research output: Working paper › Preprint

  12. Reversibility of computations in graph-walking automata

    Kunc, M. & Okhotin, A., Dec 2020, In: Information and Computation. 275, 104631.

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

Previous 1 2 3 4 5 6 7 8 ...21 Next

ID: 195867