131 - 140 out of 183Page size: 10
  1. 2009

  2. Equations over sets of natural numbers with addition only

    Jez, A. & Okhotin, A., 1 Dec 2009, STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science. p. 577-588 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 3).

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

  3. On equations over sets of numbers and their limitations

    Lehtinen, T. & Okhotin, A., 27 Aug 2009, Developments in Language Theory - 13th International Conference, DLT 2009, Proceedings. p. 360-371 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5583 LNCS).

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

  4. State complexity of power

    Domaratzki, M. & Okhotin, A., 28 May 2009, In: Theoretical Computer Science. 410, 24-25, p. 2377-2392 16 p.

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

  5. Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth

    Jez, A. & Okhotin, A., 1 Jan 2009, In: Theory of Computing Systems. 46, 1, p. 27-58 32 p.

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

  6. Conjunctive grammars with restricted disjunction

    Okhotin, A. & Reitwiener, C., 2009, SOFSEM 2009: Theory and Practice of Computer Science - 35th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 425-436 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5404 LNCS).

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

  7. One-nonterminal conjunctive grammars over a unary alphabet

    Jez, A. & Okhotin, A., 2009, Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. p. 191-202 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5675 LNCS).

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

  8. 2008

  9. Unambiguous Boolean grammars

    Okhotin, A., 1 Sep 2008, In: Information and Computation. 206, 9-10, p. 1234-1247 14 p.

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

  10. On the computational completeness of equations over sets of natural numbers

    Jez, A. & Okhotin, A., 14 Aug 2008, Automata, Languages and Programming - 35th International Colloquium, ICALP 2008, Proceedings. PART 2 ed. p. 63-74 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5126 LNCS, no. PART 2).

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

  11. State complexity of cyclic shift

    Jirásková, G. & Okhotin, A., 1 Apr 2008, In: RAIRO - Theoretical Informatics and Applications. 42, 2, p. 335-360 26 p.

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

  12. Complexity of solutions of equations over sets of natural numbers

    Jez, A. & Okhotin, A., 2008, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008. IBFI Schloss Dagstuhl, p. 373-384 12 p. (Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008).

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

Previous 1...10 11 12 13 14 15 16 17 ...19 Next

ID: 195867