Follow
Alexander Okhotin
Alexander Okhotin
Verified email at utu.fi - Homepage
Title
Cited by
Cited by
Year
Support vector machines: Theory and applications
T Evgeniou, M Pontil
Advanced course on artificial intelligence, 249-257, 1999
789*1999
Conjunctive grammars
A Okhotin
Journal of Automata, Languages and Combinatorics 6 (4), 519-535, 2001
2432001
Boolean grammars
A Okhotin
Information and Computation 194 (1), 19-48, 2004
1472004
On the equivalence of linear conjunctive grammars and trellis automata
A Okhotin
RAIRO-Theoretical Informatics and Applications 38 (1), 69-88, 2004
822004
Conjunctive and Boolean grammars: the true general case of the context-free grammars
A Okhotin
Computer Science Review 9, 27-59, 2013
772013
State complexity of cyclic shift
G Jirásková, A Okhotin
RAIRO-Theoretical Informatics and Applications 42 (2), 335-360, 2008
682008
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
A Jeż, A Okhotin
Theory of Computing Systems 46 (1), 27-58, 2010
612010
Conjunctive grammars and systems of language equations
AS Okhotin
Programming and Computer Software 28, 243-249, 2002
612002
State complexity of power
M Domaratzki, A Okhotin
Theoretical Computer Science 410 (24-25), 2377-2392, 2009
582009
Complexity of input-driven pushdown automata
A Okhotin, K Salomaa
ACM SIGACT News 45 (2), 47-67, 2014
512014
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
A Jeż, A Okhotin
Theory of Computing Systems 46 (1), 27-58, 2010
512010
Decision problems for language equations with Boolean operations
A Okhotin
Automata, Languages and Programming: 30th International Colloquium, ICALP …, 2003
412003
A recognition and parsing algorithm for arbitrary conjunctive grammars
A Okhotin
Theoretical Computer Science 302 (1-3), 365-399, 2003
402003
Parsing by matrix multiplication generalized to Boolean grammars
A Okhotin
Theoretical Computer Science 516, 101-120, 2014
392014
On the state complexity of star of union and star of intersection
G Jirásková, A Okhotin
Fundamenta Informaticae 109 (2), 161-178, 2011
392011
Decision problems for language equations
A Okhotin
Journal of Computer and System Sciences 76 (3-4), 251-266, 2010
372010
On the computational completeness of equations over sets of natural numbers
A Jeż, A Okhotin
Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008
37*2008
Unambiguous finite automata over a unary alphabet
A Okhotin
Information and Computation 212, 15-36, 2012
352012
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
352011
Recursive descent parsing for Boolean grammars
A Okhotin
Acta Informatica 44 (3), 167-189, 2007
332007
The system can't perform the operation now. Try again later.
Articles 1–20