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

  2. 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 › peer-review

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

  4. 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 › peer-review

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

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

  7. 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 › peer-review

  8. 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 › peer-review

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

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

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

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

ID: 195867