| Support vector machines: Theory and applications T Evgeniou, M Pontil Advanced course on artificial intelligence, 249-257, 1999 | 857* | 1999 |
| Conjunctive grammars A Okhotin Journal of Automata, Languages and Combinatorics 6 (4), 519-535, 2001 | 245 | 2001 |
| Boolean grammars A Okhotin Information and Computation 194 (1), 19-48, 2004 | 151 | 2004 |
| On the equivalence of linear conjunctive grammars and trellis automata A Okhotin RAIRO-Theoretical Informatics and Applications 38 (1), 69-88, 2004 | 81 | 2004 |
| Conjunctive and Boolean grammars: the true general case of the context-free grammars A Okhotin Computer Science Review 9, 27-59, 2013 | 78 | 2013 |
| State complexity of cyclic shift G Jirásková, A Okhotin RAIRO-Theoretical Informatics and Applications 42 (2), 335-360, 2008 | 69 | 2008 |
| Conjunctive grammars over a unary alphabet: undecidability and unbounded growth A Jeż, A Okhotin Theory of Computing Systems 46 (1), 27-58, 2010 | 62 | 2010 |
| Conjunctive grammars and systems of language equations AS Okhotin Programming and Computer Software 28, 243-249, 2002 | 61 | 2002 |
| State complexity of power M Domaratzki, A Okhotin Theoretical Computer Science 410 (24-25), 2377-2392, 2009 | 59 | 2009 |
| Complexity of input-driven pushdown automata A Okhotin, K Salomaa ACM SIGACT News 45 (2), 47-67, 2014 | 54 | 2014 |
| Parsing by matrix multiplication generalized to Boolean grammars A Okhotin Theoretical Computer Science 516, 101-120, 2014 | 41 | 2014 |
| Decision problems for language equations with Boolean operations A Okhotin Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003 | 40 | 2003 |
| A recognition and parsing algorithm for arbitrary conjunctive grammars A Okhotin Theoretical Computer Science 302 (1-3), 365-399, 2003 | 39 | 2003 |
| On the state complexity of star of union and star of intersection G Jirásková, A Okhotin Fundamenta Informaticae 109 (2), 161-178, 2011 | 38 | 2011 |
| On the computational completeness of equations over sets of natural numbers A Jeż, A Okhotin Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 38* | 2008 |
| Unambiguous finite automata over a unary alphabet A Okhotin Information and Computation 212, 15-36, 2012 | 37 | 2012 |
| Describing periodicity in two-way deterministic finite automata using transformation semigroups M Kunc, A Okhotin International Conference on Developments in Language Theory, 324-336, 2011 | 37 | 2011 |
| Decision problems for language equations A Okhotin Journal of Computer and System Sciences 76 (3-4), 251-266, 2010 | 37 | 2010 |
| Recursive descent parsing for Boolean grammars A Okhotin Acta Informatica 44 (3), 167-189, 2007 | 35 | 2007 |
| Reversibility of computations in graph-walking automata M Kunc, A Okhotin Information and Computation 275, 104631, 2020 | 33* | 2020 |
