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

  2. Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees

    Шеметова, Е. Н., Охотин, А. С. & Григорьев, С. В., Jun 2024, In: Theory of Computing Systems. 68, 3, p. 487-511 25 p.

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

  3. GF(2)-operations on basic families of formal languages

    Охотин, А. С., Радионова, М. А. & Сажнева, Е. А., 12 May 2024, In: Theoretical Computer Science. 995, 13 p., 114489.

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

  4. 2023

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

  6. On the transformation of two-way finite automata to unambiguous finite automata

    Петров, С. А. & Охотин, А. С., 1 Dec 2023, In: Information and Computation. 295, A, 26 p., 104956.

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

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

  8. Sweeping permutation automata

    Радионова, М. А. & Охотин, А. С., 15 Sep 2023, Proceedings of the 13th International Workshop on Non-Classical Models of Automata and Applications. Nagy, B. & Freund, R. (eds.). Open Publishing Association, p. 110–124 15 p. (Electronic Proceedings in Theoretical Computer Science; vol. 388).

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

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

  10. Parallel Enumeration of Parse Trees

    Михельсон, М. Н. & Охотин, А. С., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 272. p. 67:1-67:14 14 p. 67. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

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

  11. Probabilistic Input-Driven Pushdown Automata

    Розе, А. Н. & Охотин, А. С., Aug 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023, August 28 to September 1, 2023, Bordeaux, France. LIPIcs ed. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Vol. 272. p. 78:1-78:14 14 p. 78. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

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

  12. 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 3 4 5 6 7 8 ...19 Next

ID: 195867