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

  2. Sweeping permutation automata

    Радионова, М. А. & Охотин, А. С., 31 Jan 2026, In: Acta Informatica. 63, 30 p., 3.

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

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

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

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

  4. 2025

  5. On the expressive power of categorial grammars with unique category assignment

    Вишникин, М. Е. & Охотин, А. С., 1 Nov 2025, In: Journal of Logic, Language and Information. 34, 5, p. 635–664 30 p.

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

  6. Decision problems for systems of language equations and inequations

    Охотин, А. С., Nov 2025, In: Information and Computation. 307, 18 p., 105344.

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

  7. A Hierarchy of Reversible Finite Automata

    Радионова, М. А. & Охотин, А. С., 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. 316–329 14 p. (Lecture Notes in Computer Science; vol. 15981).

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

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

  9. Simulating Two-Way Nondeterministic Finite Automata Over Small Alphabets by One-Way Nondeterministic Automata

    Geffert, V. & Охотин, А. С., 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. 180–192 13 p. (Lecture Notes in Computer Science; vol. 15981 LNCS).

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

  10. On the Transformation of Two-Way Nondeterministic Finite Automata to Unambiguous Finite Automata

    Петров, С. А. & Охотин, А. С., 16 Aug 2025, Developments in Language Theory: 29th International Conference, DLT 2025, Seoul, South Korea, August 19–22, 2025, Proceedings. Ko, S-K. & Manea, F. (eds.). Springer Nature, p. 107–122 16 p. (Lecture Notes in Computer Science; vol. 16036 LNCS).

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

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

    Мартынова, О. М. & Охотин, А. С., 30 Jun 2025, 52nd International Colloquium on Automata, Languages, and Programming. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 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

  12. Probabilistic input-driven pushdown automata

    Розе, А. Н. & Охотин, А. С., Jun 2025, In: Information and Computation. 305, 16 p., 105312.

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

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

ID: 195867