Research output

  1. Improved bounds on the length of shortest strings accepted by two-way finite automata

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

  2. Sweeping permutation automata

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

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

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

View all (197) »

Projects

  1. Аспекты сложности в теории формальных языков: 2026 г. этап 4

    Project: Grant fulfilment › Grant stage fulfilment

  2. Аспекты сложности в теории формальных языков: 2025 г. этап 3

    Project: Grant fulfilment › Grant stage fulfilment

  3. Аспекты сложности в теории формальных языков: 2023 г. этап 1

    Project: Grant fulfilment › Grant stage fulfilment

View all () »

Activities

  1. A hierarchy of reversible finite automata

    Activity: Conference talk types › Oral presentation

  2. Simulating two-way nondeterministic finite automata over small alphabets by one-way nondeterministic automata

    Activity: Conference talk types › Oral presentation

  3. From regular expressions to deterministic finite automata: $2^{\frac{n}{2}+\sqrt{n}(\log n)^{\Theta(1)}}$ states are necessary and sufficient

    Activity: Conference talk types › Oral presentation

View all (16) »

ID: 195867