111 - 120 out of 193Page size: 10
  1. 2012

  2. Defining contexts in context-free grammars

    Barash, M. & Okhotin, A., 12 Mar 2012, Language and Automata Theory and Applications - 6th International Conference, LATA 2012, Proceedings. p. 106-118 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7183 LNCS).

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

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

    Okhotin, A. & Rondogiannis, P., 1 Mar 2012, In: Information and Computation. 212, p. 1-14 14 p.

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

  4. Unambiguous finite automata over a unary alphabet

    Okhotin, A., 1 Mar 2012, In: Information and Computation. 212, p. 15-36 22 p.

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

  5. Language equations with complementation: Expressive power

    Okhotin, A. & Yakimova, O., 27 Jan 2012, In: Theoretical Computer Science. 416, p. 71-86 16 p.

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

  6. Homomorphisms preserving deterministic context-free languages

    Lehtinen, T. & Okhotin, A., 2012, Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. p. 154-165 12 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

  7. On the number of nonterminal symbols in unambiguous conjunctive grammars

    Jez, A. & Okhotin, A., 2012, Descriptional Complexity of Formal Systems - 14th International Workshop, DCFS 2012, Proceedings. p. 183-195 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7386 LNCS).

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

  8. 2011

  9. State complexity of union and intersection for two-way nondeterministic finite automata

    Kunc, M. & Okhotin, A., 20 Sep 2011, In: Fundamenta Informaticae. 110, 1-4, p. 231-239 9 p.

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

  10. On the state complexity of star of union and star of intersection

    Jirásková, G. & Okhotin, A., 16 Sep 2011, In: Fundamenta Informaticae. 109, 2, p. 161-178 18 p.

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

  11. Expressive power of LL(k) boolean grammars

    Okhotin, A., 9 Sep 2011, In: Theoretical Computer Science. 412, 39, p. 5132-5155 24 p.

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

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

    Kunc, M. & Okhotin, A., 11 Aug 2011, Descriptional Complexity of Formal Systems - 13th International Workshop, DCFS 2011, Proceedings. p. 222-234 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6808 LNCS).

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

Previous 1...8 9 10 11 12 13 14 15 ...20 Next

ID: 195867