91 - 100 out of 183Page size: 10
  1. 2013

  2. Unambiguous conjunctive grammars over a one-letter alphabet

    Jez, A. & Okhotin, A., 19 Sep 2013, Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. p. 277-288 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7907 LNCS).

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

  3. Conjunctive and boolean grammars: The true general case of the context-free grammars

    Okhotin, A., 1 Aug 2013, In: Computer Science Review. 9, p. 27-59 33 p.

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

  4. Improved normal form for grammars with one-sided contexts

    Okhotin, A., 2013, Descriptional Complexity of Formal Systems - 15th International Workshop, DCFS 2013, Proceedings. p. 205-216 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8031 LNCS).

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

  5. 2012

  6. Parsing Boolean grammars over a one-letter alphabet using online convolution

    Okhotin, A. & Reitwießner, C., 26 Oct 2012, In: Theoretical Computer Science. 457, p. 149-157 9 p.

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

  7. Descriptional complexity of input-driven pushdown automata

    Okhotin, A., Piao, X. & Salomaa, K., 8 Oct 2012, Languages Alive: Essays Dedicated to Jurgen Dassow on the Occasion of His 65th Birthday. Bordihn, H., Kutrib, M. & Truthe, B. (eds.). p. 186-206 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7300 LNAI).

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

  8. State complexity of operations on two-way finite automata over a unary alphabet

    Kunc, M. & Okhotin, A., 31 Aug 2012, In: Theoretical Computer Science. 449, p. 106-118 13 p.

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

  9. Non-erasing variants of the Chomsky-Schützenberger theorem

    Okhotin, A., 20 Aug 2012, Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. p. 121-129 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7410 LNCS).

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

  10. Representing Hyper-arithmetical Sets by Equations over Sets of Integers

    Jez, A. & Okhotin, A., 1 Aug 2012, In: Theory of Computing Systems. 51, 2, p. 196-228 33 p.

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

  11. Language equations with symmetric difference

    Okhotin, A., 28 May 2012, In: Fundamenta Informaticae. 116, 1-4, p. 205-222 18 p.

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

  12. Solving language equations and disequations with applications to disunification in description logics and monadic set constraints

    Baader, F. & Okhotin, A., 21 Mar 2012, Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Proceedings. p. 107-121 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7180 LNCS).

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

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

ID: 195867