81 - 90 out of 201Page size: 10
  1. 2017

  2. The Quotient Operation on Input-Driven Pushdown Automata

    Okhotin, A. & Salomaa, K., 2017, In: Lecture Notes in Computer Science. 10316, p. 299-310

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

  3. Unambiguous conjunctive grammars over a one-symbol alphabet

    Jez, A. & Okhotin, A., 2017, In: Theoretical Computer Science. 665, p. 13-39

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

  4. 2016

  5. Computational and proof complexity of partial string avoidability

    Itsykson, D., Okhotin, A. & Oparin, V., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

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

  6. Descriptional Complexity of Formal Systems

    Jürgensen, H., Karhumäki, J. & Okhotin, A., 11 Jan 2016, In: Theoretical Computer Science. 610, 1 p.

    Research output: Contribution to journal › Editorial

  7. Approximate unification in the description logic FL0

    Baader, F., Marantidis, P. & Okhotin, A., 2016, In: Lecture Notes in Computer Science. 10021, p. 49-63

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

  8. Equations over sets of integers with addition only

    Jez, A. & Okhotin, A., 2016, In: Journal of Computer and System Sciences. 82, 6, p. 1007-1019

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

  9. Input-driven languages are linear conjunctive

    Okhotin, A., 2016, In: Theoretical Computer Science. 618, p. 52-71

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

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

    Jez, A. & Okhotin, A., 2016, In: Theoretical Computer Science. 619, p. 68-86

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

  11. The hardest language for conjunctive grammars

    Okhotin, A., 2016, In: Lecture Notes in Computer Science. 9691, p. 340-351

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

  12. 2015

  13. Two-sided context specifications in formal grammars

    Barash, M. & Okhotin, A., 2 Aug 2015, In: Theoretical Computer Science. 591, p. 134-153 20 p.

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

Previous 1...5 6 7 8 9 10 11 12 ...21 Next

ID: 195867