1. 2019
  2. 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 journalArticlepeer-review

  3. 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 proceedingConference contributionpeer-review

  4. State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages

    Okhotin, A. & Sazhneva, E., 1 Jul 2019, Descriptional Complexity of Formal Systems - 21st IFIP WG 1.02 International Conference, DCFS 2019, Proceedings. Hospodár, M., Jirásková, G. & Konstantinidis, S. (eds.). Springer Nature, p. 248-259 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11612 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  5. Hardest languages for conjunctive and Boolean grammars

    Okhotin, A., 1 Jun 2019, In: Information and Computation. 266, p. 1-18 18 p.

    Research output: Contribution to journalArticlepeer-review

  6. On the expressive power of GF(2)-grammars

    Makarov, V. & Okhotin, A., 1 Jan 2019, SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Královič, R., Pighizzini, G., Nawrocki, J. & Catania, B. (eds.). Springer Nature, p. 310-323 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  7. On the length of shortest strings accepted by two-way finite automata

    Dobronravov, E., Dobronravov, N. & Okhotin, A., 1 Jan 2019, Developments in Language Theory - 23rd International Conference, DLT 2019, Proceedings. Hofman, P. & Skrzypczak, M. (eds.). Springer Nature, p. 88-99 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11647 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  8. Preface

    Martín-Vide, C., Shapira, D. & Okhotin, A., 1 Jan 2019, 13th International Conference on Language and Automata Theory and Applications. Vol. 11417 LNCS. p. V (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

    Research output: Chapter in Book/Report/Conference proceedingForeword/postscript

  9. 2018
  10. A Tale of Conjunctive Grammars

    Okhotin, A., 1 Sep 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Nature, p. 36-59 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  11. Preface

    Kari, J. & Okhotin, A., 1 Jun 2018, In: International Journal of Foundations of Computer Science. 29, 4, p. 457-459 3 p.

    Research output: Contribution to journalEditorial

  12. Linear-space recognition for grammars with contexts

    Barash, M. & Okhotin, A., 6 Apr 2018, In: Theoretical Computer Science. 719, p. 73-85 13 p.

    Research output: Contribution to journalArticlepeer-review

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

ID: 195867