Alexander Okhotin
Alexander Okhotin
Verified email at utu.fi - Homepage
Title
Cited by
Cited by
Year
Conjunctive grammars
A Okhotin
Journal of Automata, Languages and Combinatorics 6 (4), 519-535, 2001
2222001
Boolean grammars
A Okhotin
Information and Computation 194 (1), 19-48, 2004
1342004
On the equivalence of linear conjunctive grammars and trellis automata
A Okhotin
RAIRO-Theoretical Informatics and Applications 38 (1), 69-88, 2004
762004
Conjunctive and Boolean grammars: the true general case of the context-free grammars
A Okhotin
Computer Science Review 9, 27-59, 2013
682013
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
A Jeż, A Okhotin
Theory of Computing Systems 46 (1), 27-58, 2010
632010
Conjunctive grammars and systems of language equations
AS Okhotin
Programming and Computer Software 28 (5), 243-249, 2002
622002
State complexity of cyclic shift
G Jirásková, A Okhotin
RAIRO-Theoretical Informatics and Applications 42 (2), 335-360, 2008
562008
Conjunctive grammars over a unary alphabet: undecidability and unbounded growth
A Jeż, A Okhotin
Theory of Computing Systems 46 (1), 27-58, 2010
502010
State complexity of power
M Domaratzki, A Okhotin
Theoretical Computer Science 410 (24-25), 2377-2392, 2009
502009
Complexity of input-driven pushdown automata
A Okhotin, K Salomaa
ACM SIGACT News 45 (2), 47-67, 2014
402014
Decision problems for language equations with Boolean operations
A Okhotin
International Colloquium on Automata, Languages, and Programming, 239-251, 2003
392003
On the computational completeness of equations over sets of natural numbers
A Jeż, A Okhotin
International Colloquium on Automata, Languages, and Programming, 63-74, 2008
38*2008
A recognition and parsing algorithm for arbitrary conjunctive grammars
A Okhotin
Theoretical Computer Science 302 (1-3), 365-399, 2003
382003
Decision problems for language equations
A Okhotin
Journal of Computer and System Sciences 76 (3-4), 251-266, 2010
362010
Parsing by matrix multiplication generalized to Boolean grammars
A Okhotin
Theoretical Computer Science 516, 101-120, 2014
352014
On the state complexity of star of union and star of intersection
G Jirásková, A Okhotin
Fundamenta Informaticae 109 (2), 161-178, 2011
312011
Recursive descent parsing for Boolean grammars
A Okhotin
Acta Informatica 44 (3-4), 167-189, 2007
312007
On the closure properties of linear conjunctive languages
A Okhotin
Theoretical Computer Science 299 (1-3), 663-685, 2003
312003
On the computational completeness of equations over sets of natural numbers
A Jeż, A Okhotin
International Colloquium on Automata, Languages, and Programming, 63-74, 2008
302008
Unresolved systems of language equations: expressive power and decision problems
A Okhotin
Theoretical Computer Science 349 (3), 283-308, 2005
302005
The system can't perform the operation now. Try again later.
Articles 1–20