21 - 30 out of 198Page size: 10
  1. 2023

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

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

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

  5. 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. 14 p. 78. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 272).

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

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

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

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

  9. On the Transformation of LL(k)-linear to LL(1)-linear Grammars

    Ольховский, И. С. & Охотин, А. С., 1 Apr 2023, In: Theory of Computing Systems. 67, 2, p. 234-262 29 p.

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

  10. The Hardest LL(k) Language

    Мрыхин, М. К. & Охотин, А. С., Apr 2023, In: International Journal of Foundations of Computer Science. 34, 2&3, p. 289-319 31 p.

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

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

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

ID: 195867