71 - 80 out of 196Page size: 10
  1. 2017

  2. Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts

    Barash, M. & Okhotin, A., 1 Aug 2017, In: Theory of Computing Systems. 61, 2, p. 581-605 25 p.

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

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

    Jirásková, G. & Okhotin, A., 1 Apr 2017, In: Information and Computation. 253, 1, p. 36-63 28 p.

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

  4. Conjunctive categorial grammars

    Kuznetsov, S. & Okhotin, A., 2017, Proceedings of the 15th Meeting on the Mathematics of Language: MOL 2017, London, UK, July 13-14, 2017. Kanazawa, M., de Groote, P. & Sadrzadeh, M. (eds.). Association for Computational Linguistics

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

  5. Edit distance neighbourhoods of input-driven pushdown automata

    Okhotin, A. & Salomaa, K., 2017, Computer Science – Theory and Applications: International Computer Science Symposium in Russia. p. 260-272 (Lecture Notes in Computer Science; vol. 10304).

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

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

    Okhotin, A. & Salomaa, K., 2017, In: Journal of Computer and System Sciences. 86, p. 207-228

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

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

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

  9. 2016

  10. 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.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

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

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

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

Previous 1...4 5 6 7 8 9 10 11 ...20 Next

ID: 195867