1 - 2 out of 2Page size: 10
  1. 2021

  2. On the Length of Shortest Strings Accepted by Two-way Finite Automata

    Dobronravov, E., Dobronravov, N. & Okhotin, A., 30 Jun 2021, In: Fundamenta Informaticae. 180, 4, p. 315-331 17 p.

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

  3. 2019

  4. 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 proceeding › Conference contribution › Research › peer-review

ID: 13778684