Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAlexander Okhotin
Person information
- affiliation: St. Petersburg State University, Rusia
- affiliation (former): University of Turku, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j86]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. ACM Trans. Comput. Theory 13(1): 6:1-6:25 (2021)- [c83]Semyon Petrov
, Alexander Okhotin:
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. LATA 2021: 81-93 - [c82]Mikhail Mrykhin, Alexander Okhotin:
On Hardest Languages for One-Dimensional Cellular Automata. LATA 2021: 118-130 - [c81]Olga Martynova, Alexander Okhotin:
Lower Bounds for Graph-Walking Automata. STACS 2021: 52:1-52:13 - [i9]Mizuhito Ogawa, Alexander Okhotin:
On the determinization of event-clock input-driven pushdown automata. CoRR abs/2103.04079 (2021) - 2020
- [j85]Michal Kunc, Alexander Okhotin:
Reversibility of computations in graph-walking automata. Inf. Comput. 275: 104631 (2020) - [j84]Franz Baader, Pavlos Marantidis, Antoine Mottet, Alexander Okhotin:
Extensions of unification modulo ACUI. Math. Struct. Comput. Sci. 30(6): 597-626 (2020) - [c80]Alexander Okhotin, Ilya Olkhovsky:
On the Transformation of LL(k)-linear Grammars to LL(1)-linear. CSR 2020: 328-340 - [c79]Stanislav Krymski, Alexander Okhotin:
Longer Shortest Strings in Two-Way Finite Automata. DCFS 2020: 104-116 - [c78]Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages. DCFS 2020: 142-154 - [c77]Alexander Okhotin, Alexey Sorokin:
Cyclic Shift on Multi-component Grammars. LATA 2020: 287-299 - [i8]Olga Martynova, Alexander Okhotin:
State complexity of halting, returning and reversible graph-walking automata. CoRR abs/2011.14856 (2020) - [i7]Alexander Okhotin, Victor L. Selivanov:
Input-driven automata on well-nested infinite strings: automata-theoretic and topological properties. CoRR abs/2012.03395 (2020) - [i6]Alexander Okhotin:
Describing the syntax of programming languages using conjunctive and Boolean grammars. CoRR abs/2012.03538 (2020) - [i5]Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev:
Rational index of bounded-oscillation languages. CoRR abs/2012.03567 (2020) - [i4]Mikhail Mrykhin, Alexander Okhotin:
The hardest language for grammars with context operators. CoRR abs/2012.03596 (2020) - [i3]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and proof complexity of partial string avoidability. Electron. Colloquium Comput. Complex. 27: 67 (2020)
2010 – 2019
- 2019
- [j83]Alexander Okhotin:
Hardest languages for conjunctive and Boolean grammars. Inf. Comput. 266: 1-18 (2019) - [j82]Alexander Okhotin, Kai Salomaa:
State Complexity of the Quotient Operation on Input-Driven Pushdown Automata. Int. J. Found. Comput. Sci. 30(6-7): 1217-1235 (2019) - [j81]Alexander Okhotin, Kai Salomaa:
Edit distance neighbourhoods of input-driven pushdown automata. Theor. Comput. Sci. 777: 417-430 (2019) - [j80]Galina Jirásková, Alexander Okhotin:
State complexity of unambiguous operations on finite automata. Theor. Comput. Sci. 798: 52-64 (2019) - [j79]Alexander Okhotin, Kai Salomaa:
Further closure properties of input-driven pushdown automata. Theor. Comput. Sci. 798: 65-77 (2019) - [c76]Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. DCFS 2019: 248-259 - [c75]Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin:
On the Length of Shortest Strings Accepted by Two-Way Finite Automata. DLT 2019: 88-99 - [c74]Vladislav Makarov, Alexander Okhotin:
On the Expressive Power of GF(2)-Grammars. SOFSEM 2019: 310-323 - [c73]Alexander Okhotin:
Graph-Walking Automata: From Whence They Come, and Whither They are Bound. CIAA 2019: 10-29 - [e4]Carlos Martín-Vide, Alexander Okhotin, Dana Shapira:
Language and Automata Theory and Applications - 13th International Conference, LATA 2019, St. Petersburg, Russia, March 26-29, 2019, Proceedings. Lecture Notes in Computer Science 11417, Springer 2019, ISBN 978-3-030-13434-1 [contents] - 2018
- [j78]Artur Jez, Alexander Okhotin:
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. Fundam. Informaticae 162(1): 43-72 (2018) - [j77]Jeffrey O. Shallit, Alexander Okhotin:
Preface. Inf. Comput. 259(2): 161 (2018) - [j76]Jarkko Kari, Alexander Okhotin:
Preface. Int. J. Found. Comput. Sci. 29(4): 457-459 (2018) - [j75]Mikhail Barash, Alexander Okhotin:
Linear-space recognition for grammars with contexts. Theor. Comput. Sci. 719: 73-85 (2018) - [c72]Galina Jirásková, Alexander Okhotin:
State Complexity of Unambiguous Operations on Deterministic Finite Automata. DCFS 2018: 188-199 - [c71]Alexander Okhotin, Kai Salomaa:
Further Closure Properties of Input-Driven Pushdown Automata. DCFS 2018: 224-236 - [c70]Alexander Okhotin:
A Tale of Conjunctive Grammars. DLT 2018: 36-59 - [c69]Galina Jirásková, Alexander Okhotin:
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. DLT 2018: 441-452 - [c68]Alexander Okhotin:
Underlying Principles and Recurring Ideas of Formal Grammars. LATA 2018: 36-59 - [c67]Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva:
Formal Languages over GF(2). LATA 2018: 68-79 - 2017
- [j74]Galina Jirásková, Alexander Okhotin:
On the state complexity of operations on two-way finite automata. Inf. Comput. 253: 36-63 (2017) - [j73]Alexander Okhotin, Kai Salomaa:
State complexity of operations on input-driven pushdown automata. J. Comput. Syst. Sci. 86: 207-228 (2017) - [j72]Mikhail Barash, Alexander Okhotin:
Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts. Theory Comput. Syst. 61(2): 581-605 (2017) - [j71]Artur Jez, Alexander Okhotin:
Unambiguous conjunctive grammars over a one-symbol alphabet. Theor. Comput. Sci. 665: 13-39 (2017) - [c66]Alexander Okhotin, Kai Salomaa:
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. CSR 2017: 260-272 - [c65]Alexander Okhotin, Kai Salomaa:
The Quotient Operation on Input-Driven Pushdown Automata. DCFS 2017: 299-310 - [c64]Stepan Kuznetsov, Alexander Okhotin:
Conjunctive Categorial Grammars. MOL 2017: 140-151 - 2016
- [j70]Artur Jez, Alexander Okhotin:
Equations over sets of integers with addition only. J. Comput. Syst. Sci. 82(6): 1007-1019 (2016) - [j69]Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin:
Descriptional Complexity of Formal Systems. Theor. Comput. Sci. 610: 1 (2016) - [j68]Alexander Okhotin:
Input-driven languages are linear conjunctive. Theor. Comput. Sci. 618: 52-71 (2016) - [j67]Artur Jez, Alexander Okhotin:
Least and greatest solutions of equations over sets of integers. Theor. Comput. Sci. 619: 68-86 (2016) - [c63]Alexander Okhotin:
The Hardest Language for Conjunctive Grammars. CSR 2016: 340-351 - [c62]Franz Baader, Pavlos Marantidis, Alexander Okhotin:
Approximate Unification in the Description Logic FL_0. JELIA 2016: 49-63 - [c61]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. MFCS 2016: 51:1-51:13 - 2015
- [j66]Mikhail Barash, Alexander Okhotin:
Linear grammars with one-sided contexts and their automaton representation. RAIRO Theor. Informatics Appl. 49(2): 153-178 (2015) - [j65]Alexander Okhotin:
On language equations with concatenation and various sets of Boolean operations. RAIRO Theor. Informatics Appl. 49(3): 205-232 (2015) - [j64]Alexander Okhotin, Kai Salomaa:
Descriptional complexity of unambiguous input-driven pushdown automata. Theor. Comput. Sci. 566: 1-11 (2015) - [j63]Alexander Okhotin:
Improved normal form for grammars with one-sided contexts. Theor. Comput. Sci. 588: 52-72 (2015) - [j62]Mikhail Barash, Alexander Okhotin:
Two-sided context specifications in formal grammars. Theor. Comput. Sci. 591: 134-153 (2015) - [c60]Mikhail Barash, Alexander Okhotin:
Generalized LR Parsing for Grammars with Contexts. CSR 2015: 67-79 - [e3]Jeffrey O. Shallit, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Waterloo, ON, Canada, June 25-27, 2015. Proceedings. Lecture Notes in Computer Science 9118, Springer 2015, ISBN 978-3-319-19224-6 [contents] - 2014
- [j61]Artur Jez, Alexander Okhotin:
Computational completeness of equations over sets of natural numbers. Inf. Comput. 237: 56-94 (2014) - [j60]Mikhail Barash, Alexander Okhotin:
An extension of context-free grammars with one-sided context specifications. Inf. Comput. 237: 268-293 (2014) - [j59]Alexander Okhotin, Kai Salomaa:
Complexity of input-driven pushdown automata. SIGACT News 45(2): 47-67 (2014) - [j58]Alexander Okhotin:
Parsing by matrix multiplication generalized to Boolean grammars. Theor. Comput. Sci. 516: 101-120 (2014) - [c59]Juhani Karhumäki, Alexander Okhotin:
On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages. Computing with New Resources 2014: 71-82 - [c58]Alexander Okhotin, Kai Salomaa:
Input-Driven Pushdown Automata with Limited Nondeterminism - (Invited Paper). Developments in Language Theory 2014: 84-102 - [c57]Mikhail Barash, Alexander Okhotin:
Linear Grammars with One-Sided Contexts and Their Automaton Representation. LATIN 2014: 190-201 - [c56]Viliam Geffert, Alexander Okhotin:
Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata. MFCS (1) 2014: 291-302 - [c55]Mikhail Barash, Alexander Okhotin:
Grammars with two-sided contexts. AFL 2014: 94-108 - [e2]Helmut Jürgensen, Juhani Karhumäki, Alexander Okhotin:
Descriptional Complexity of Formal Systems - 16th International Workshop, DCFS 2014, Turku, Finland, August 5-8, 2014. Proceedings. Lecture Notes in Computer Science 8614, Springer 2014, ISBN 978-3-319-09703-9 [contents] - 2013
- [j57]Alexander Okhotin:
Conjunctive and Boolean grammars: The true general case of the context-free grammars. Comput. Sci. Rev. 9: 27-59 (2013) - [j56]Franz Baader, Alexander Okhotin:
On Language Equations with One-sided Concatenation. Fundam. Informaticae 126(1): 1-35 (2013) - [j55]Tommi Lehtinen, Alexander Okhotin:
Homomorphisms Preserving Deterministic Context-Free Languages. Int. J. Found. Comput. Sci. 24(7): 1049-1066 (2013) - [c54]Alexander Okhotin:
Improved Normal Form for Grammars with One-Sided Contexts. DCFS 2013: 205-216 - [c53]Artur Jez, Alexander Okhotin:
Unambiguous Conjunctive Grammars over a One-Letter Alphabet. Developments in Language Theory 2013: 277-288 - [c52]Michal Kunc, Alexander Okhotin:
Reversibility of Computations in Graph-Walking Automata. MFCS 2013: 595-606 - [c51]Alexander Okhotin, Kai Salomaa:
Input-driven pushdown automata: nondeterminism and unambiguity. NCMA 2013: 31-33 - [c50]Viliam Geffert, Alexander Okhotin:
One-way simulation of two-way finite automata over small alphabets. NCMA 2013: 151-162 - 2012
- [j54]Alexander Okhotin:
Language Equations with Symmetric Difference. Fundam. Informaticae 116(1-4): 205-222 (2012) - [j53]Alexander Okhotin, Panos Rondogiannis:
On the expressive power of univariate equations over sets of natural numbers. Inf. Comput. 212: 1-14 (2012) - [j52]Alexander Okhotin:
Unambiguous finite automata over a unary alphabet. Inf. Comput. 212: 15-36 (2012) - [j51]Artur Jez, Alexander Okhotin:
Representing Hyper-arithmetical Sets by Equations over Sets of Integers. Theory Comput. Syst. 51(2): 196-228 (2012) - [j50]Alexander Okhotin, Oksana Yakimova:
Language equations with complementation: Expressive power. Theor. Comput. Sci. 416: 71-86 (2012) - [j49]Michal Kunc, Alexander Okhotin:
State complexity of operations on two-way finite automata over a unary alphabet. Theor. Comput. Sci. 449: 106-118 (2012) - [j48]Alexander Okhotin, Christian Reitwießner:
Parsing Boolean grammars over a one-letter alphabet using online convolution. Theor. Comput. Sci. 457: 149-157 (2012) - [c49]Alexander Okhotin, Xiaoxue Piao, Kai Salomaa:
Descriptional Complexity of Input-Driven Pushdown Automata. Languages Alive 2012: 186-206 - [c48]Artur Jez, Alexander Okhotin:
On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars. DCFS 2012: 183-195 - [c47]Alexander Okhotin:
Non-erasing Variants of the Chomsky-Schützenberger Theorem. Developments in Language Theory 2012: 121-129 - [c46]Tommi Lehtinen, Alexander Okhotin:
Homomorphisms Preserving Deterministic Context-Free Languages. Developments in Language Theory 2012: 154-165 - [c45]Mikhail Barash, Alexander Okhotin:
Defining Contexts in Context-Free Grammars. LATA 2012: 106-118 - [c44]Franz Baader, Alexander Okhotin:
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. LPAR 2012: 107-121 - 2011
- [j47]Galina Jirásková, Alexander Okhotin:
On the State Complexity of Star of Union and Star of Intersection. Fundam. Informaticae 109(2): 161-178 (2011) - [j46]Michal Kunc, Alexander Okhotin:
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. Fundam. Informaticae 110(1-4): 231-239 (2011) - [j45]Tommi Lehtinen, Alexander Okhotin:
On Equations over Sets of Numbers and their Limitations. Int. J. Found. Comput. Sci. 22(2): 377-393 (2011) - [j44]Artur Jez, Alexander Okhotin:
Complexity of Equations over Sets of Natural Numbers. Theory Comput. Syst. 48(2): 319-342 (2011) - [j43]Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. Theory Comput. Syst. 49(2): 319-342 (2011) - [j42]Alexander Okhotin:
A simple P-complete problem and its language-theoretic representations. Theor. Comput. Sci. 412(1-2): 68-82 (2011) - [j41]Alexander Okhotin:
Expressive power of LL(k) Boolean grammars. Theor. Comput. Sci. 412(39): 5132-5155 (2011) - [c43]Michal Kunc, Alexander Okhotin:
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. DCFS 2011: 222-234 - [c42]Michal Kunc, Alexander Okhotin:
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. Developments in Language Theory 2011: 324-336 - [c41]Alexander Okhotin, Kai Salomaa:
Descriptional Complexity of Unambiguous Nested Word Automata. LATA 2011: 414-426 - [c40]Alexander Okhotin, Kai Salomaa:
State Complexity of Operations on Input-Driven Pushdown Automata. MFCS 2011: 485-496 - [c39]Alexander Okhotin:
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. SOFSEM 2011: 431-443 - 2010
- [j40]Alexander Okhotin:
On the State Complexity of Scattered Substrings and Superstrings. Fundam. Informaticae 99(3): 325-338 (2010) - [j39]Artur Jez, Alexander Okhotin:
Univariate Equations Over Sets of Natural Numbers. Fundam. Informaticae 104(4): 329-348 (2010) - [j38]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computational power of two stacks with restricted communication. Inf. Comput. 208(9): 1060-1089 (2010) - [j37]Tommi Lehtinen, Alexander Okhotin:
Boolean Grammars and GSM Mappings. Int. J. Found. Comput. Sci. 21(5): 799-815 (2010) - [j36]Galina Jirásková, Alexander Okhotin:
Nondeterministic State Complexity of Positional Addition. J. Autom. Lang. Comb. 15(1/2): 121-133 (2010) - [j35]Alexander Okhotin:
Decision problems for language equations. J. Comput. Syst. Sci. 76(3-4): 251-266 (2010) - [j34]Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. Theory Comput. Syst. 46(1): 27-58 (2010) - [j33]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On stateless multihead automata: Hierarchies and the emptiness problem. Theor. Comput. Sci. 411(3): 581-593 (2010) - [j32]Alexander Okhotin, Christian Reitwießner:
Conjunctive grammars with restricted disjunction. Theor. Comput. Sci. 411(26-28): 2559-2571 (2010) - [c38]Tommi Lehtinen, Alexander Okhotin:
On Language Equations XXK = XXL and XM = N over a Unary Alphabet. Developments in Language Theory 2010: 291-302 - [c37]Alexander Okhotin:
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. Developments in Language Theory 2010: 340-351 - [c36]Artur Jez, Alexander Okhotin:
Least and Greatest Solutions of Equations over Sets of Integers. MFCS 2010: 441-452 - [c35]Alexander Okhotin:
Unambiguous Finite Automata over a Unary Alphabet. MFCS 2010: 556-567 - [c34]Artur Jez, Alexander Okhotin:
On Equations over Sets of Integers. STACS 2010: 477-488 - [i2]Alexander Okhotin, Christian Reitwießner:
Parsing Unary Boolean Grammars Using Online Convolution. Advances and Applications of Automata on Words and Trees 2010 - [i1]Artur Jez, Alexander Okhotin:
On equations over sets of integers. CoRR abs/1001.2932 (2010)
2000 – 2009
- 2009
- [j31]Michael Domaratzki, Alexander Okhotin:
State complexity of power. Theor. Comput. Sci. 410(24-25): 2377-2392 (2009) - [c33]Artur Jez, Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. CSR 2009: 191-202 - [c32]Tommi Lehtinen, Alexander Okhotin:
On Equations over Sets of Numbers and Their Limitations. Developments in Language Theory 2009: 360-371 - [c31]Alexander Okhotin, Christian Reitwießner:
Conjunctive Grammars with Restricted Disjunction. SOFSEM 2009: 425-436 - [c30]Artur Jez, Alexander Okhotin:
Equations over Sets of Natural Numbers with Addition Only. STACS 2009: 577-588 - [c29]Galina Jirásková, Alexander Okhotin:
Nondeterministic State Complexity of Positional Addition. DCFS 2009: 151-161 - 2008
- [j30]Alexander Okhotin:
Unambiguous Boolean grammars. Inf. Comput. 206(9-10): 1234-1247 (2008) - [j29]Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. RAIRO Theor. Informatics Appl. 42(2): 335-360 (2008) - [j28]Alexander Okhotin:
Homomorphisms Preserving Linear Conjunctive Languages. J. Autom. Lang. Comb. 13(3/4): 299-305 (2008) - [c28]Tommi Lehtinen, Alexander Okhotin:
Boolean grammars and gsm mappings. AFL 2008: 269-280 - [c27]Galina Jirásková, Alexander Okhotin:
On the State Complexity of Operations on Two-Way Finite Automata. Developments in Language Theory 2008: 443-454 - [c26]Artur Jez, Alexander Okhotin:
On the Computational Completeness of Equations over Sets of Natural Numbers. ICALP (2) 2008: 63-74 - [c25]Alexander Okhotin, Panos Rondogiannis:
On the expressive power of univariate equations over sets of natural numbers. IFIP TCS 2008: 215-227 - [c24]Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. LATIN 2008: 94-105 - [c23]Alexander Okhotin, Artur Jez:
Complexity of solutions of equations over sets of natural numbers. STACS 2008: 373-384 - [c22]Alexander Okhotin:
Representing a P-complete problem by small trellis automata. CSP 2008: 185-198 - 2007
- [j27]Alexander Okhotin:
Recursive descent parsing for Boolean grammars. Acta Informatica 44(3-4): 167-189 (2007) - [j26]Alexander Okhotin:
Nine Open Problems on Conjunctive and Boolean Grammars. Bull. EATCS 91: 96-119 (2007) - [j25]Alexander Okhotin:
Notes on Dual Concatenation. Int. J. Found. Comput. Sci. 18(6): 1361-1370 (2007) - [j24]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. J. Autom. Lang. Comb. 12(1-2): 79-95 (2007) - [j23]Alexander Okhotin, Oksana Yakimova:
Language equations with complementation: Decision problems. Theor. Comput. Sci. 376(1-2): 112-126 (2007) - [c21]