91 - 100 out of 198Page size: 10
  1. 2015

  2. Descriptional Complexity of Formal Systems

    Shallit, J. & Okhotin, A., 1 Jan 2015, Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Proceedings. Okhotin, A. & Shallit, J. (eds.). Springer Nature, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9118).

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

  3. Descriptional complexity of unambiguous input-driven pushdown automata

    Okhotin, A. & Salomaa, K., 1 Jan 2015, In: Theoretical Computer Science. 566, C, p. 1-11 11 p.

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

  4. Generalized LR parsing for grammars with contexts

    Barash, M. & Okhotin, A., 1 Jan 2015, Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Proceedings. Beklemishev, L. D., Musatov, D. V. & Musatov, D. V. (eds.). Springer Nature, p. 67-79 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9139).

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

  5. 2014

  6. Grammars with two-sided contexts

    Barash, M. & Okhotin, A., 21 May 2014, In: Electronic Proceedings in Theoretical Computer Science, EPTCS. 151, p. 94-108 15 p.

    Research output: Contribution to journal › Conference article › peer-review

  7. Parsing by matrix multiplication generalized to Boolean grammars

    Okhotin, A., 9 Jan 2014, In: Theoretical Computer Science. 516, p. 101-120 20 p.

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

  8. An extension of context-free grammars with one-sided context specifications

    Barash, M. & Okhotin, A., 1 Jan 2014, In: Information and Computation. 237, p. 268-293 26 p.

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

  9. Computational completeness of equations over sets of natural numbers

    Jez, A. & Okhotin, A., 1 Jan 2014, In: Information and Computation. 237, p. 56-94 39 p.

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

  10. Input-driven pushdown automata with limited nondeterminism (Invited Paper)

    Okhotin, A. & Salomaa, K., 1 Jan 2014, Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings. Springer Nature, p. 84-102 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8633 LNCS).

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

  11. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

    Okhotin, A., Jürgensen, H. & Karhumäki, J., 1 Jan 2014, 16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8614 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Foreword/postscript › Research

  12. Linear grammars with one-sided contexts and their automaton representation

    Barash, M. & Okhotin, A., 1 Jan 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Nature, p. 190-201 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

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

Previous 1...6 7 8 9 10 11 12 13 ...20 Next

ID: 195867