default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Okhotin
Person information
- affiliation: University of Turku, Finland
- affiliation: St. Petersburg State University, Rusia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j102]Margarita Mikhelson, Alexander Okhotin:
A parallel algorithm for counting parse trees. Inf. Comput. 303: 105237 (2025)- 2024
- [j101]Ekaterina N. Shemetova
, Alexander Okhotin, Semyon V. Grigorev:
Rational Index of Languages Defined by Grammars with Bounded Dimension of Parse Trees. Theory Comput. Syst. 68(3): 487-511 (2024) - [j100]Alexander Okhotin, Maria Radionova, Elizaveta Sazhneva:
GF(2)-operations on basic families of formal languages. Theor. Comput. Sci. 995: 114489 (2024) - [c97]Maria Radionova, Alexander Okhotin:
Decision Problems for Reversible and Permutation Automata. CIAA 2024: 302-315 - [i15]Stepan L. Kuznetsov, Alexander Okhotin:
Conjunctive categorial grammars and Lambek grammars with additives. CoRR abs/2405.16662 (2024) - 2023
- [j99]Olga Martynova, Alexander Okhotin:
State complexity of transforming graph-walking automata to halting, returning and reversible. Inf. Comput. 291: 105011 (2023) - [j98]Olga Martynova, Alexander Okhotin:
Non-closure under complementation for unambiguous linear grammars. Inf. Comput. 292: 105031 (2023) - [j97]Mikhail Mrykhin, Alexander Okhotin:
On hardest languages for one-dimensional cellular automata. Inf. Comput. 295(Part B): 104891 (2023) - [j96]Semyon Petrov, Alexander Okhotin:
On the transformation of two-way finite automata to unambiguous finite automata. Inf. Comput. 295(Part B): 104956 (2023) - [j95]Mikhail Mrykhin, Alexander Okhotin:
The Hardest LL(k) Language. Int. J. Found. Comput. Sci. 34(2&3): 289-319 (2023) - [j94]Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages. J. Autom. Lang. Comb. 28(1-3): 121-141 (2023) - [j93]Ilya Olkhovsky, Alexander Okhotin:
On the Transformation of LL(k)-linear to LL(1)-linear Grammars. Theory Comput. Syst. 67(2): 234-262 (2023) - [j92]Ilya Olkhovsky, Alexander Okhotin:
Correction to: On the Transformation of LL(k)-linear to LL(1)-linear Grammars. Theory Comput. Syst. 67(2): 263 (2023) - [j91]Mikhail Mrykhin, Alexander Okhotin:
The hardest language for grammars with context operators. Theor. Comput. Sci. 958: 113829 (2023) - [j90]Olga Martynova, Alexander Okhotin:
Homomorphisms and inverse homomorphisms on graph-walking automata. Theor. Comput. Sci. 979: 114197 (2023) - [c96]Olga Martynova, Alexander Okhotin:
Shortest Accepted Strings for Two-Way Finite Automata: Approaching the 2n Lower Bound. DCFS 2023: 134-145 - [c95]Margarita Mikhelson, Alexander Okhotin:
Parallel Enumeration of Parse Trees. MFCS 2023: 67:1-67:14 - [c94]Alex Rose, Alexander Okhotin:
Probabilistic Input-Driven Pushdown Automata. MFCS 2023: 78:1-78:14 - [c93]Olga Martynova, Alexander Okhotin:
A Time to Cast Away Stones. CIAA 2023: 242-253 - [c92]Maria Radionova, Alexander Okhotin:
Sweeping Permutation Automata. NCMA 2023: 110-124 - [i14]Semyon Petrov, Fedor Petrov, Alexander Okhotin:
On the rank of the communication matrix for deterministic two-way finite automata. CoRR abs/2312.05909 (2023) - 2022
- [j89]Ekaterina Bakinova, Artem Basharin, Igor Batmanov, Konstantin Lyubort, Alexander Okhotin, Elizaveta Sazhneva:
Formal languages over GF(2). Inf. Comput. 283: 104672 (2022) - [j88]Alexander Okhotin, Elizaveta Sazhneva:
State complexity of GF(2)-operations on unary languages. Inf. Comput. 284: 104693 (2022) - [c91]Mizuhito Ogawa, Alexander Okhotin:
On the Determinization of Event-Clock Input-Driven Pushdown Automata. CSR 2022: 256-268 - [c90]Ekaterina N. Shemetova, Alexander Okhotin, Semyon V. Grigorev:
Rational Index of Languages with Bounded Dimension of Parse Trees. DLT 2022: 263-273 - [c89]Olga Martynova, Alexander Okhotin:
Homomorphisms on Graph-Walking Automata. CIAA 2022: 177-188 - [i13]Olga Martynova, Alexander Okhotin:
The maximum length of shortest accepted strings for direction-determinate two-way finite automata. CoRR abs/2210.00235 (2022) - [i12]Olga Martynova, Alexander Okhotin:
Non-closure under complementation for unambiguous linear grammars. CoRR abs/2210.02329 (2022) - 2021
- [j87]Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin:
On the Length of Shortest Strings Accepted by Two-way Finite Automata. Fundam. Informaticae 180(4): 315-331 (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) - [c88]Alexander Okhotin, Victor L. Selivanov:
Input-Driven Pushdown Automata on Well-Nested Infinite Strings. CSR 2021: 349-360 - [c87]Viliam Geffert, Alexander Okhotin:
Deterministic One-Way Simulation of Two-Way Deterministic Finite Automata over Small Alphabets. DCFS 2021: 26-37 - [c86]Olga Martynova, Alexander Okhotin:
State Complexity of Union and Intersection on Graph-Walking Automata. DCFS 2021: 125-136 - [c85]Mikhail Mrykhin, Alexander Okhotin:
The Hardest LL(k) Language. DLT 2021: 304-315 - [c84]Semyon Petrov, Alexander Okhotin:
On the Transformation of Two-Way Deterministic Finite Automata to Unambiguous Finite Automata. LATA 2021: 81-93 - [c83]Mikhail Mrykhin, Alexander Okhotin:
On Hardest Languages for One-Dimensional Cellular Automata. LATA 2021: 118-130 - [c82]Olga Martynova, Alexander Okhotin:
Lower Bounds for Graph-Walking Automata. STACS 2021: 52:1-52:13 - [p1]Michal Kunc, Alexander Okhotin:
Language equations. Handbook of Automata Theory (I.) 2021: 765-799 - [i11]Mizuhito Ogawa, Alexander Okhotin:
On the determinization of event-clock input-driven pushdown automata. CoRR abs/2103.04079 (2021) - [i10]Olga Martynova, Alexander Okhotin:
Homomorphisms on graph-walking automata. CoRR abs/2111.10214 (2021) - [i9]Ilya Olkhovsky, Alexander Okhotin:
On LL(k) linear conjunctive grammars. CoRR abs/2112.08014 (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) - [c81]Alexander Okhotin, Ilya Olkhovsky:
On the Transformation of LL(k)-linear Grammars to LL(1)-linear. CSR 2020: 328-340 - [c80]Stanislav Krymski, Alexander Okhotin:
Longer Shortest Strings in Two-Way Finite Automata. DCFS 2020: 104-116 - [c79]Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages. DCFS 2020: 142-154 - [c78]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. TR20 (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) - [c77]Alexander Okhotin, Elizaveta Sazhneva:
State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. DCFS 2019: 248-259 - [c76]Egor Dobronravov, Nikita Dobronravov, Alexander Okhotin:
On the Length of Shortest Strings Accepted by Two-Way Finite Automata. DLT 2019: 88-99 - [c75]Vladislav Makarov, Alexander Okhotin:
On the Expressive Power of GF(2)-Grammars. SOFSEM 2019: 310-323 - [c74]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) - [c73]Galina Jirásková, Alexander Okhotin:
State Complexity of Unambiguous Operations on Deterministic Finite Automata. DCFS 2018: 188-199 - [c72]Alexander Okhotin, Kai Salomaa:
Further Closure Properties of Input-Driven Pushdown Automata. DCFS 2018: 224-236 - [c71]Alexander Okhotin:
A Tale of Conjunctive Grammars. DLT 2018: 36-59 - [c70]Galina Jirásková, Alexander Okhotin:
Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata. DLT 2018: 441-452 - [c69]Alexander Okhotin:
Underlying Principles and Recurring Ideas of Formal Grammars. LATA 2018: 36-59 - [c68]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) - [c67]Alexander Okhotin, Kai Salomaa:
Edit Distance Neighbourhoods of Input-Driven Pushdown Automata. CSR 2017: 260-272 - [c66]Alexander Okhotin, Kai Salomaa:
The Quotient Operation on Input-Driven Pushdown Automata. DCFS 2017: 299-310 - [c65]Stepan L. 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) - [c64]Alexander Okhotin:
The Hardest Language for Conjunctive Grammars. CSR 2016: 340-351 - [c63]Franz Baader, Pavlos Marantidis, Alexander Okhotin:
Approximate Unification in the Description Logic FL_0. JELIA 2016: 49-63 - [c62]Dmitry Itsykson, Alexander Okhotin, Vsevolod Oparin:
Computational and Proof Complexity of Partial String Avoidability. MFCS 2016: 51:1-51:13 - [c61]Franz Baader, Pavlos Marantidis, Alexander Okhotin:
Approximately Solving Set Equations. UNIF 2016: 37-43 - 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]Artur Jez, Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. CSR 2007: 168-181 - [c20]Alexander Okhotin:
Expressive Power of LL(k) Boolean Grammars. FCT 2007: 446-457 - [c19]Alexander Okhotin:
Unambiguous Boolean grammars. LATA 2007: 473-484 - [c18]Alexander Okhotin:
A Simple P-Complete Problem and Its Representations by Language Equations. MCU 2007: 267-278 - 2006
- [j22]Alexander Okhotin:
Computational Universality in One-variable Language Equations. Fundam. Informaticae 74(4): 563-578 (2006) - [j21]Alexander Okhotin:
Generalized Lr Parsing Algorithm for Boolean Grammars. Int. J. Found. Comput. Sci. 17(3): 629-664 (2006) - [j20]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Computing by commuting. Theor. Comput. Sci. 356(1-2): 200-211 (2006) - [c17]Alexander Okhotin:
Language Equations with Symmetric Difference. CSR 2006: 292-303 - [c16]Alexander Okhotin, Oksana Yakimova:
Language Equations with Complementation. Developments in Language Theory 2006: 420-432 - [c15]Juhani Karhumäki, Michal Kunc, Alexander Okhotin:
Communication of Two Stacks and Rewriting. ICALP (2) 2006: 468-479 - 2005
- [j19]Alexander Okhotin, Kai Salomaa:
Contextual Grammars with Uniform Sets of Trajectories. Fundam. Informaticae 64(1-4): 341-351 (2005) - [j18]Alexander Okhotin:
A characterization of the arithmetical hierarchy by language equations. Int. J. Found. Comput. Sci. 16(5): 985-998 (2005) - [j17]Alexander Okhotin:
The dual of concatenation. Theor. Comput. Sci. 345(2-3): 425-447 (2005) - [j16]Alexander Okhotin:
Unresolved systems of language equations: Expressive power and decision problems. Theor. Comput. Sci. 349(3): 283-308 (2005) - [c14]Michael Domaratzki, Alexander Okhotin, Jeffrey O. Shallit:
Enumeration of Context-Free Languages and Related Structures. DCFS 2005: 85-96 - [c13]Galina Jirásková, Alexander Okhotin:
State complexity of cyclic shift. DCFS 2005: 182-193 - [c12]Alexander Okhotin:
LR Parsing for Boolean Grammars. Developments in Language Theory 2005: 362-373 - [c11]Alexander Okhotin:
Strict Language Inequalities and Their Decision Problems. MFCS 2005: 708-719 - 2004
- [j15]Alexander Okhotin:
Boolean grammars. Inf. Comput. 194(1): 19-48 (2004) - [j14]Alexander Okhotin:
On the equivalence of linear conjunctive grammars and trellis automata. RAIRO Theor. Informatics Appl. 38(1): 69-88 (2004) - [j13]Alexander Okhotin:
State Complexity of Linear Conjunctive Languages. J. Autom. Lang. Comb. 9(2/3): 365-381 (2004) - [j12]Michael Domaratzki, Alexander Okhotin:
Representing recursively enumerable languages by iterated deletion. Theor. Comput. Sci. 314(3): 451-457 (2004) - [j11]Alexander Okhotin:
On the number of nonterminals in linear conjunctive grammars. Theor. Comput. Sci. 320(2-3): 419-448 (2004) - [c10]Alexander Okhotin:
A characterization of the arithmetical hierarchy by language equations. DCFS 2004: 225-237 - [c9]Alexander Okhotin:
On Computational Universality in Language Equations. MCU 2004: 292-303 - [c8]Alexander Okhotin:
The Dual of Concatenation. MFCS 2004: 698-710 - [e1]Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu:
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3317, Springer 2004, ISBN 3-540-24318-6 [contents] - 2003
- [j10]Alexander Okhotin:
An overview of conjunctive grammars, Formal Language Theory Column. Bull. EATCS 79: 145-163 (2003) - [j9]Alexander Okhotin:
Efficient Automaton-Based Recognition For Linear Conjunctive Languages. Int. J. Found. Comput. Sci. 14(6): 1103-1116 (2003) - [j8]Alexander Okhotin:
The hardest linear conjunctive language. Inf. Process. Lett. 86(5): 247-253 (2003) - [j7]Alexander Okhotin:
On the closure properties of linear conjunctive languages. Theor. Comput. Sci. 299(1-3): 663-685 (2003) - [j6]Alexander Okhotin:
A recognition and parsing algorithm for arbitrary conjunctive grammars. Theor. Comput. Sci. 302(1-3): 365-399 (2003) - [c7]Alexander Okhotin:
On the Number of Nonterminals in Linear Conjunctive Grammars. DCFS 2003: 274-283 - [c6]Alexander Okhotin:
Boolean Grammars. Developments in Language Theory 2003: 398-410 - [c5]Alexander Okhotin:
Decision Problems for Language Equations with Boolean Operations. ICALP 2003: 239-251 - 2002
- [j5]Alexander Okhotin, Kai Salomaa, Michael Domaratzki:
One-Visit Caterpillar Tree Automata. Fundam. Informaticae 52(4): 361-375 (2002) - [j4]Alexander Okhotin:
Top-Down Parsing of Conjunctive Languages. Grammars 5(1): 21-40 (2002) - [j3]Alexander Okhotin:
LR Parsing for Conjunctive Grammars. Grammars 5(2): 81-124 (2002) - [j2]Alexander Okhotin:
Conjunctive Grammars and Systems of Language Equations. Program. Comput. Softw. 28(5): 243-249 (2002) - [c4]Alexander Okhotin:
State complexity of linear conjunctive languages. DCFS 2002: 256-270 - [c3]Alexander Okhotin:
Automaton Representation of Linear Conjunctive Languages. Developments in Language Theory 2002: 393-404 - [c2]Alexander Okhotin:
Efficient Automaton-Based Recognition for Linear Conjunctive Languages. CIAA 2002: 169-181 - [c1]Alexander Okhotin:
Whale Calf, a Parser Generator for Conjunctive Grammars. CIAA 2002: 213-220 - 2001
- [j1]Alexander Okhotin:
Conjunctive Grammars. J. Autom. Lang. Comb. 6(4): 519-535 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-08 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
