1 - 10 out of 15Page size: 10
  1. 2026

  2. State Complexity of Boolean Operations on Graph-Walking Automata

    Мартынова, О. М. & Охотин, А. С., Sep 2026, In: International Journal of Foundations of Computer Science. 37, 6, p. 723-743 21 p.

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

  3. Improved bounds on the length of shortest strings accepted by two-way finite automata

    Мартынова, О. М. & Охотин, А. С., Jun 2026, In: Information and Computation. 311, 11 p., 105462.

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

  4. 2025

  5. From regular expressions to deterministic finite automata: 2^{\frac{n}{2}+\sqrt{n}(\log n)^{\Theta(1)}} states are necessary and sufficient

    Мартынова, О. М. & Охотин, А. С., 22 Aug 2025, Implementation and Application of Automata: 29th International Conference, CIAA 2025, Palermo, Italy, September 22–25, 2025, Proceedings. Castiglione, G. & Mantaci, S. (eds.). Springer Nature, p. 267–280 14 p. (Lecture Notes in Computer Science; vol. 15981 LNCS).

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

  6. Nondeterministic tree-walking automata are not closed under complementation

    Мартынова, О. М. & Охотин, А. С., 30 Jun 2025, 52nd International Colloquium on Automata, Languages, and Programming. Dagstuhl Publishing, 17 p. 168. (Leibniz International Proceedings in Informatics (LIPIcs); vol. 334).

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

  7. A Time to Cast Away Stones: On a Family of Pebble Automata

    Мартынова, О. М. & Охотин, А. С., 25 Jan 2025, In: International Journal of Foundations of Computer Science. 37, 1, p. 23-46 24 p.

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

  8. 2024

  9. Exact Descriptional Complexity of Determinization of Input-Driven Pushdown Automata

    Мартынова, О. М., Sep 2024, Implementation and Application of Automata. Fazekas, S. (ed.). Springer Nature, p. 249-260 12 p. (Lecture Notes in Computer Science; vol. 15015).

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

  10. Complexity of the emptiness problem for graph-walking automata and for tilings with star subgraphs

    Мартынова, О. М., Jan 2024, In: Information and Computation. 296, 19 p., 105127.

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

  11. 2023

  12. Homomorphisms and inverse homomorphisms on graph-walking automata

    Мартынова, О. М. & Охотин, А. С., 1 Nov 2023, In: Theoretical Computer Science. 979, 114197.

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

  13. A time to cast away stones

    Мартынова, О. М. & Охотин, А. С., Sep 2023, Implementation and Application of Automata - 27th International Conference, CIAA 2023, Famagusta, North Cyprus, September 19-22, 2023, Proceedings. Springer Nature, p. 242–253 12 p. ( Lecture Notes in Computer Science; vol. 14151).

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

  14. Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2^n Lower Bound

    Мартынова, О. М. & Охотин, А. С., Jul 2023, Descriptional Complexity of Formal Systems - 25th IFIP WG 1.02 International Conference, DCFS 2023, Potsdam, Germany, July 4-6, 2023, Proceedings. Lecture Notes in Computer Science ed. Springer Nature, Vol. 13918. p. 134-145 12 p.

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

Previous 1 2 Next

ID: 13760615