501 - 510 out of 718Page size: 10
  1. 2011

  2. Expressive power of LL(k) boolean grammars

    Okhotin, A., 9 Sep 2011, In: Theoretical Computer Science. 412, 39, p. 5132-5155 24 p.

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

  3. State complexity of operations on two-way deterministic finite automata over a unary alphabet

    Kunc, M. & Okhotin, A., 11 Aug 2011, Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Proceedings. p. 222-234 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6808 LNCS).

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

  4. Exact values of complexity for Paoluzzi-Zimmermann manifolds

    Vesnin, A. Y. & Fominykh, E. A., 1 Aug 2011, In: Doklady Mathematics. 84, 1, p. 542-544 3 p.

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

  5. One-Nonterminal Conjunctive Grammars over a Unary Alphabet

    Jez, A. & Okhotin, A., 1 Aug 2011, In: Theory of Computing Systems. 49, 2, p. 319-342 24 p.

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

  6. Algorithms for searching for hidden oscillations in the Aizerman and Kalman problems

    Leonov, G. A. & Kuznetsov, N. V., Aug 2011, In: Doklady Mathematics. 84, 1, p. 475-481 7 p.

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

  7. Computation of phase detector characteristics in synchronization systems

    Leonov, G. A., Kuznetsov, N. V., Yuldashev, M. V. & Yuldashev, R. V., Aug 2011, In: Doklady Mathematics. 84, 1, p. 586-590 5 p.

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

  8. Describing periodicity in two-way deterministic finite automata using transformation semigroups

    Kunc, M. & Okhotin, A., 29 Jul 2011, Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings. p. 324-336 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6795 LNCS).

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

  9. Locally catenative sequences and Turtle graphics

    Karhumäki, J. & Puzynina, S., 1 Jul 2011, In: RAIRO - Theoretical Informatics and Applications. 45, 3, p. 311-330 20 p.

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

  10. Descriptional complexity of unambiguous nested word automata

    Okhotin, A. & Salomaa, K., 8 Jun 2011, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Proceedings. p. 414-426 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6638 LNCS).

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

  11. Dehn surgeries on the figure eight knot: An upper bound for complexity

    Fominykh, E. A., 1 May 2011, In: Siberian Mathematical Journal. 52, 3, p. 537-543 7 p.

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

Previous 1...47 48 49 50 51 52 53 54 ...72 Next

ID: 20420