1 - 10 out of 10Page size: 10
  1. 2024

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

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

  4. 2023

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

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

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

  8. Non-closure under complementation for unambiguous linear grammars

    Мартынова, О. М. & Охотин, А. С., 1 Jun 2023, In: Information and Computation. 292, 105031.

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

  9. State complexity of transforming graph-walking automata to halting, returning and reversible

    Мартынова, О. М. & Охотин, А. С., 1 Mar 2023, In: Information and Computation. 291, 24 p., 105011.

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

  10. 2022

  11. Homomorphisms on Graph-Walking Automata

    Martynova, O. & Okhotin, A., Jun 2022, Implementation and Application of Automata - 26th International Conference, CIAA 2022, Proceedings. Caron, P. & Mignot, L. (eds.). Springer Nature, p. 177-188 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13266 LNCS).

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

  12. 2021

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

  14. 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.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 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

ID: 13760615