151 - 160 out of 195Page size: 10
  1. 2008

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

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

  4. On stateless multihead automata: Hierarchies and the emptiness problem

    Ibarra, O. H., Karhumäki, J. & Okhotin, A., 2008, LATIN 2008: Theoretical Informatics - 8th Latin American Symposium, Proceedings. p. 94-105 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4957 LNCS).

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

  5. On the expressive power of univariate equations over sets of natural numbers

    Okhotin, A. & Rondogiannis, P., 2008, Fifth Ifip International Conference On Theoretical Computer Science - Tcs 2008. Ausiello, G., Karhumäki, J., Mauri, G. & Ong, L. (eds.). p. 215-227 13 p. (IFIP International Federation for Information Processing; vol. 273).

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

  6. On the state complexity of operations on two-way finite automata

    Jirásková, G. & Okhotin, A., 2008, Developments in Language Theory - 12th International Conference, DLT 2008, Proceedings. p. 443-454 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5257 LNCS).

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

  7. 2007

  8. A simple P-complete problem and its representations by language equations

    Okhotin, A., 1 Dec 2007, Machines, Computations, and Universality - 5th International Conference, MCU 2007, Proceedings. p. 267-278 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4664 LNCS).

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

  9. Notes on dual concatenation

    Okhotin, A., 1 Dec 2007, In: International Journal of Foundations of Computer Science. 18, 6, p. 1361-1370 10 p.

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

  10. Recursive descent parsing for Boolean grammars

    Okhotin, A., 1 Jul 2007, In: Acta Informatica. 44, 3-4, p. 167-189 23 p.

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

  11. Language equations with complementation: Decision problems

    Okhotin, A. & Yakimova, O., 10 May 2007, In: Theoretical Computer Science. 376, 1-2, p. 112-126 15 p.

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

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

    Jez, A. & Okhotin, A., 2007, Computer Science - Theory and Applications - Second International Symposium on Computer Science in Russia, CSR 2007, Proceedings. Springer Nature, p. 168-181 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4649 LNCS).

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

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

ID: 195867