141 - 150 out of 196Page size: 10
  1. 2010

  2. Least and greatest solutions of equations over sets of integers

    Jez, A. & Okhotin, A., 2010, Mathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Proceedings. p. 441-452 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6281 LNCS).

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

  3. On equations over sets of integers

    Jez, A. & Okhotin, A., 2010, STACS 2010 - 27th International Symposium on Theoretical Aspects of Computer Science. p. 477-488 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 5).

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

  4. Unambiguous finite automata over a unary alphabet

    Okhotin, A., 2010, Mathematical Foundations of Computer Science 2010 - 35th International Symposium, MFCS 2010, Proceedings. p. 556-567 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6281 LNCS).

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

  5. 2009

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

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

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

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

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

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

  12. 2008

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

Previous 1...11 12 13 14 15 16 17 18 ...20 Next

ID: 195867