121 - 130 out of 195Page 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. 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

  5. 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

  6. 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

  7. On equations over sets of numbers and their limitations

    Lehtinen, T. & Okhotin, A., Feb 2011, In: International Journal of Foundations of Computer Science. 22, 2, p. 377-393 17 p.

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

  8. Comparing linear conjunctive languages to subfamilies of the context-free languages

    Okhotin, A., 26 Jan 2011, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 431-443 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6543 LNCS).

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

  9. A simple P-complete problem and its language-theoretic representations

    Okhotin, A., 1 Jan 2011, In: Theoretical Computer Science. 412, 1-2, p. 68-82 15 p.

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

  10. Complexity of Equations over Sets of Natural Numbers

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

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

  11. State complexity of operations on input-driven pushdown automata

    Okhotin, A. & Salomaa, K., 2011, Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Proceedings. p. 485-496 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6907 LNCS).

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

Previous 1...9 10 11 12 13 14 15 16 ...20 Next

ID: 195867