51 - 60 out of 201Page size: 10
  1. 2020

  2. Extensions of unification modulo ACUI

    Baader, F., Marantidis, P., Mottet, A. & Okhotin, A., 1 Jun 2020, In: Mathematical Structures in Computer Science. 30, 6, p. 597-626 30 p.

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

  3. On the transformation of ll(k)-linear grammars to ll(1)-linear

    Okhotin, A. & Olkhovsky, I., 1 Jun 2020, Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings. Fernau, H. (ed.). Springer Nature, p. 328-340 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12159 LNCS).

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

  4. Cyclic shift on multi-component grammars

    Okhotin, A. & Sorokin, A., 1 Jan 2020, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. Leporati, A., Martín-Vide, C., Shapira, D. & Zandron, C. (eds.). Springer Nature, p. 287-299 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12038 LNCS).

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

  5. Longer Shortest Strings in Two-Way Finite Automata

    Крымский, С. Т. & Okhotin, A., 2020, Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings. Jirásková, G. & Pighizzini, G. (eds.). Springer Nature, p. 104-116 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12442 LNCS).

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

  6. State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

    Okhotin, A. & Sazhneva, E., 2020, Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings. Jirásková, G. & Pighizzini, G. (eds.). Springer Nature, p. 142-154 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12442 LNCS).

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

  7. 2019

  8. Further closure properties of input-driven pushdown automata

    Okhotin, A. & Salomaa, K., 17 Dec 2019, In: Theoretical Computer Science. 798, p. 65-77 13 p.

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

  9. State complexity of unambiguous operations on finite automata

    Jirásková, G. & Okhotin, A., 17 Dec 2019, In: Theoretical Computer Science. 798, p. 52-64 13 p.

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

  10. State Complexity of the Quotient Operation on Input-Driven Pushdown Automata

    Okhotin, A. & Salomaa, K., 1 Sep 2019, In: International Journal of Foundations of Computer Science. 30, 6-7, p. 1217-1235 19 p.

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

  11. Edit distance neighbourhoods of input-driven pushdown automata

    Okhotin, A. & Salomaa, K., 19 Jul 2019, In: Theoretical Computer Science. 777, p. 417-430 14 p.

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

  12. Graph-Walking Automata: From Whence They Come, and Whither They are Bound

    Okhotin, A., 1 Jul 2019, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Hospodár, M. & Jirásková, G. (eds.). Springer Nature, p. 10-29 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11601 LNCS).

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

Previous 12 3 4 5 6 7 8 9 ...21 Next

ID: 195867