Find Research Outputs

Search results

• 2012

  Defining contexts in context-free grammars

  Barash, M. & Okhotin, A., 12 Mar 2012, Language and Automata Theory and Applications - 6th International Conference, LATA 2012, Proceedings. p. 106-118 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7183 LNCS).

  Research output › › peer-review

  • Parsing
  • Context free grammars
  • Context-free Grammar
  • Strings
  • Recognition Algorithm
  5 Citations (Scopus)

• Non-erasing variants of the Chomsky-Schützenberger theorem

  Okhotin, A., 20 Aug 2012, Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings. p. 121-129 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7410 LNCS).

  Research output › › peer-review

  • Context free languages
  • Context-free Languages
  • Homomorphism
  • Language
  • Formal languages
  20 Citations (Scopus)
• 2014

  On the determinization blowup for finite automata recognizing equal-length languages

  Karhumäki, J. & Okhotin, A., 1 Jan 2014, Computing with New Resources: Essays Dedicated to Jozef Gruska on the Occasion of His 80th Birthday. p. 71-82 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8808).

  Research output › › peer-review

  • Finite automata
  • Finite Automata
  • Image Compression
  • Blow-up
  • Language
• 2012

  Descriptional complexity of input-driven pushdown automata

  Okhotin, A., Piao, X. & Salomaa, K., 8 Oct 2012, Languages Alive: Essays Dedicated to Jurgen Dassow on the Occasion of His 65th Birthday. Bordihn, H., Kutrib, M. & Truthe, B. (eds.). p. 186-206 21 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7300 LNAI).

  Research output › › peer-review

  • Descriptional Complexity
  • Pushdown Automata
  • Automata
  • Costs
  • State Complexity
  7 Citations (Scopus)
• 2013

  Conjunctive and boolean grammars: The true general case of the context-free grammars

  Okhotin, A., 1 Aug 2013, In : Computer Science Review. 9, p. 27-59 33 p.

  Research output

  • Context free grammars
  • Context-free Grammar
  • Grammar
  • Parsing
  • Formal Model
  40 Citations (Scopus)
• 2016

  The hardest language for conjunctive grammars

  Okhotin, A., 2016, In : Lecture Notes in Computer Science. 9691, p. 340-351

  Research output
  1 Citation (Scopus)
• 2012

  Language equations with complementation: Expressive power

  Okhotin, A. & Yakimova, O., 27 Jan 2012, In : Theoretical Computer Science. 416, p. 71-86 16 p.

  Research output

  Open Access

  • Formal languages
  • Complementation
  • Expressive Power
  • Computer science
  • Language
  6 Citations (Scopus)
• 2016

  Input-driven languages are linear conjunctive

  Okhotin, A., 2016, In : Theoretical Computer Science. 618, p. 52-71

  Research output
  10 Citations (Scopus)
• 2012

  Parsing Boolean grammars over a one-letter alphabet using online convolution

  Okhotin, A. & Reitwießner, C., 26 Oct 2012, In : Theoretical Computer Science. 457, p. 149-157 9 p.

  Research output

  Open Access

  • Parsing
  • Grammar
  • Convolution
  • Context free grammars
  • Multiplication
  7 Citations (Scopus)

• State complexity of operations on two-way finite automata over a unary alphabet

  Kunc, M. & Okhotin, A., 31 Aug 2012, In : Theoretical Computer Science. 449, p. 106-118 13 p.

  Research output

  Open Access

  • State Complexity
  • Unary
  • Finite automata
  • Finite Automata
  • Concatenation
  11 Citations (Scopus)
• 2011

  Expressive power of LL(k) boolean grammars

  Okhotin, A., 9 Sep 2011, In : Theoretical Computer Science. 412, 39, p. 5132-5155 24 p.

  Research output

  Open Access

  • Formal languages
  • Expressive Power
  • Grammar
  • Language
  • Parsing
  4 Citations (Scopus)
• 2018

  Further closure properties of input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 1 Jan 2018, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Springer Nature, p. 224-236 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).

  Research output

  • Pushdown Automata
  • Closure Properties
  • Insertion
  • Deletion
  • Square root
  1 Citation (Scopus)
• 2017

  On the state complexity of operations on two-way finite automata

  Jiraskova, G. & Okhotin, A., 2017, In : Information and Computation. 253, 1, p. 36-63

  Research output
  2 Citations (Scopus)

• Generalized LR Parsing Algorithm for Grammars with One-Sided Contexts

  Barash, M. & Okhotin, A., 2017, In : Theory of Computing Systems. 61, 2, p. 581-605

  Research output
  7 Citations (Scopus)
• 2018

  State complexity of unambiguous operations on deterministic finite automata

  Jirásková, G. & Okhotin, A., 1 Jan 2018, Descriptional Complexity of Formal Systems - 20th IFIP WG 1.02 International Conference, DCFS 2018, Proceedings. Springer Nature, p. 188-199 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10952 LNCS).

  Research output

  • State Complexity
  • Deterministic Finite Automata
  • Concatenation
  • Finite automata
  • Union
  1 Citation (Scopus)

• Towards Exact State Complexity Bounds for Input-Driven Pushdown Automata

  Jirásková, G. & Okhotin, A., 1 Jan 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Nature, p. 441-452 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

  Research output

  • State Complexity
  • Pushdown Automata
  • Restriction
  • Lower bound
  • Concatenation
  1 Citation (Scopus)
• 2011

  State complexity of union and intersection for two-way nondeterministic finite automata

  Kunc, M. & Okhotin, A., 20 Sep 2011, In : Fundamenta Informaticae. 110, 1-4, p. 231-239 9 p.

  Research output

  • State Complexity
  • Finite automata
  • Finite Automata
  • Union
  • Intersection
  6 Citations (Scopus)
• 2018

  On the number of nonterminal symbols in unambiguous conjunctive grammars

  Jez, A. & Okhotin, A., 1 Jan 2018, In : Fundamenta Informaticae. 162, 1, p. 43-72 30 p.

  Research output

  • Formal languages
  • Grammar
  • Regular Languages
  • Strictly
  • Language
• 2011

  One-Nonterminal Conjunctive Grammars over a Unary Alphabet

  Jez, A. & Okhotin, A., 1 Aug 2011, In : Theory of Computing Systems. 49, 2, p. 319-342 24 p.

  Research output

  • Context free grammars
  • Unary
  • Grammar
  • Finiteness
  • Language
  9 Citations (Scopus)
• 2017

  State complexity of operations on input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 2017, In : Journal of Computer and System Sciences. 86, p. 207-228

  Research output
  13 Citations (Scopus)
• 2011

  Complexity of Equations over Sets of Natural Numbers

  Jez, A. & Okhotin, A., 1 Jan 2011, In : Theory of Computing Systems. 48, 2, p. 319-342 24 p.

  Research output

  • Natural number
  • Pipe
  • Completeness
  • Grammar
  • System of equations
  22 Citations (Scopus)
• 2018

  Preface

  Kari, J. & Okhotin, A., 1 Jun 2018, In : International Journal of Foundations of Computer Science. 29, 4, p. 457-459 3 p.

  Research output
• 2012

  Unambiguous finite automata over a unary alphabet

  Okhotin, A., 1 Mar 2012, In : Information and Computation. 212, p. 15-36 22 p.

  Research output

  Open Access

  • Unary
  • Finite automata
  • Finite Automata
  • G-function
  • Trade-offs
  22 Citations (Scopus)
• 2011

  Describing periodicity in two-way deterministic finite automata using transformation semigroups

  Kunc, M. & Okhotin, A., 29 Jul 2011, Developments in Language Theory - 15th International Conference, DLT 2011, Proceedings. p. 324-336 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6795 LNCS).

  Research output › › peer-review

  • Transformation Semigroups
  • Deterministic Finite Automata
  • Finite automata
  • Periodicity
  • Strings
  20 Citations (Scopus)
• 2016

  Equations over sets of integers with addition only

  Jez, A. & Okhotin, A., 2016, In : Journal of Computer and System Sciences. 82, 6, p. 1007-1019

  Research output
• 2020

  State Complexity of GF(2)-inverse and GF(2)-star on Binary Languages

  Okhotin, A. & Sazhneva, E., 2020, Descriptional Complexity of Formal Systems - 22nd International Conference, 2020, Proceedings. Jirásková, G. & Pighizzini, G. (eds.). Springer Nature, p. 142-154 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12442 LNCS).

  Research output

  • State Complexity
  • Formal languages
  • Star
  • Binary
  • Language
• 2019

  On the length of shortest strings accepted by two-way finite automata

  Dobronravov, E., Dobronravov, N. & Okhotin, A., 1 Jan 2019, Developments in Language Theory - 23rd International Conference, DLT 2019, Proceedings. Hofman, P. & Skrzypczak, M. (eds.). Springer Nature, p. 88-99 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11647 LNCS).

  Research output

  • Finite automata
  • Finite Automata
  • Strings
  • Automata
  • Deterministic Finite Automata

• State complexity of unambiguous operations on finite automata

  Jirásková, G. & Okhotin, A., 17 Dec 2019, In : Theoretical Computer Science. 798, p. 52-64

  Research output

  • State Complexity
  • Concatenation
  • Finite automata
  • Finite Automata
  • Union
  3 Citations (Scopus)
• 2011

  On the state complexity of star of union and star of intersection

  Jirásková, G. & Okhotin, A., 16 Sep 2011, In : Fundamenta Informaticae. 109, 2, p. 161-178 18 p.

  Research output

  • State Complexity
  • Star
  • Union
  • Intersection
  • Language
  12 Citations (Scopus)
• 2019

  Hardest languages for conjunctive and Boolean grammars

  Okhotin, A., 1 Jun 2019, In : Information and Computation. 266, p. 1-18 18 p.

  Research output

  • Context free languages
  • Grammar
  • Context-free Languages
  • Language
  • Homomorphic
• 2016

  Least and greatest solutions of equations over sets of integers

  Jez, A. & Okhotin, A., 2016, In : Theoretical Computer Science. 619, p. 68-86

  Research output
• 2019

  Preface

  Martín-Vide, C., Shapira, D. & Okhotin, A., 1 Jan 2019, 13th International Conference on Language and Automata Theory and Applications. Vol. 11417 LNCS. p. V (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

  Research output
• 2012

  Solving language equations and disequations with applications to disunification in description logics and monadic set constraints

  Baader, F. & Okhotin, A., 21 Mar 2012, Logic for Programming, Artificial Intelligence, and Reasoning - 18th International Conference, LPAR-18, Proceedings. p. 107-121 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7180 LNCS).

  Research output › › peer-review

  • Description Logics
  • Automata
  • Language
  • Color
  • Boolean Operation
  5 Citations (Scopus)
• 2013

  Unambiguous conjunctive grammars over a one-letter alphabet

  Jez, A. & Okhotin, A., 19 Sep 2013, Developments in Language Theory - 17th International Conference, DLT 2013, Proceedings. p. 277-288 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7907 LNCS).

  Research output › › peer-review

  • Cellular automata
  • Grammar
  • Unary
  • Language
  • Cellular Automata
  2 Citations (Scopus)
• 2016

  Approximate unification in the description logic FL0

  Baader, F., Marantidis, P. & Okhotin, A., 2016, In : Lecture Notes in Computer Science. 10021, p. 49-63

  Research output
  3 Citations (Scopus)
• 2011

  A simple P-complete problem and its language-theoretic representations

  Okhotin, A., 1 Jan 2011, In : Theoretical Computer Science. 412, 1-2, p. 68-82 15 p.

  Research output

  Open Access

  • Formal languages
  • Grammar
  • Language
  • Networks (circuits)
  • Formal Languages
  4 Citations (Scopus)
• 2014

  Parsing by matrix multiplication generalized to Boolean grammars

  Okhotin, A., 9 Jan 2014, In : Theoretical Computer Science. 516, p. 101-120 20 p.

  Research output

  Open Access

  • Parsing
  • Boolean Matrix
  • Matrix multiplication
  • Grammar
  • Context-free Grammar
  23 Citations (Scopus)

• Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

  Okhotin, A., Jürgensen, H. & Karhumäki, J., 1 Jan 2014, 16th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2014. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8614 LNCS).

  Research output
• 2012

  Language equations with symmetric difference

  Okhotin, A., 28 May 2012, In : Fundamenta Informaticae. 116, 1-4, p. 205-222 18 p.

  Research output

  • Language
  • Concatenation
  • Recursively Enumerable Set
  • Solution Existence
  • Expressive Power
  4 Citations (Scopus)
• 2014

  Computational completeness of equations over sets of natural numbers

  Jez, A. & Okhotin, A., 1 Jan 2014, In : Information and Computation. 237, p. 56-94 39 p.

  Research output

  Open Access

  • Natural number
  • Completeness
  • Arithmetical Hierarchy
  • Decision problem
  • Family
  8 Citations (Scopus)
• 2018

  Preface

  Shallit, J. & Okhotin, A., 1 Apr 2018, In : Information and Computation. 259, p. 161-161 1 p.

  Research output
• 2012

  On the expressive power of univariate equations over sets of natural numbers

  Okhotin, A. & Rondogiannis, P., 1 Mar 2012, In : Information and Computation. 212, p. 1-14 14 p.

  Research output

  Open Access

  • Expressive Power
  • Natural number
  • Univariate
  • Exponential Growth
  • Additive Basis
  11 Citations (Scopus)
• 2014

  An extension of context-free grammars with one-sided context specifications

  Barash, M. & Okhotin, A., 1 Jan 2014, In : Information and Computation. 237, p. 268-293 26 p.

  Research output

  Open Access
  15 Citations (Scopus)
• 2018

  Linear-space recognition for grammars with contexts

  Barash, M. & Okhotin, A., 6 Apr 2018, In : Theoretical Computer Science. 719, p. 73-85 13 p.

  Research output

  • Context free grammars
  • Grammar
  • Syntactics
  • Linear Space
  • Context
  1 Citation (Scopus)
• 2019

  Further closure properties of input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 17 Dec 2019, In : Theoretical Computer Science. 798, p. 65-77

  Research output

  • Pushdown Automata
  • Closure Properties
  • Insertion
  • Deletion
  • Square root
• 2020

  Extensions of unification modulo ACUI

  Baader, F., Marantidis, P., Mottet, A. & Okhotin, A., 1 Jun 2020, In : Mathematical Structures in Computer Science. 30, 6, p. 597-626

  Research output

  • Unification
  • Substitution reactions
  • Modulo
  • Testing
  • Equational Theory
• 2019

  Edit distance neighbourhoods of input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 19 Jul 2019, In : Theoretical Computer Science. 777, p. 417-430 14 p.

  Research output

  • Context free languages
  • Edit Distance
  • Formal languages
  • Pushdown Automata
  • Strings
  3 Citations (Scopus)

• On the expressive power of GF(2)-grammars

  Makarov, V. & Okhotin, A., 1 Jan 2019, SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. Královič, R., Pighizzini, G., Nawrocki, J. & Catania, B. (eds.). Springer Nature, p. 310-323 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11376 LNCS).

  Research output

  • Context free grammars
  • Formal languages
  • Concatenation
  • Expressive Power
  • Grammar
  4 Citations (Scopus)
• 2020

  On the transformation of ll(k)-linear grammars to ll(1)-linear

  Okhotin, A. & Olkhovsky, I., 1 Jun 2020, Computer Science – Theory and Applications - 15th International Computer Science Symposium in Russia, CSR 2020, Proceedings. Fernau, H. (ed.). Springer Nature, p. 328-340 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12159 LNCS).

  Research output

  • Grammar
  • Blow-up
  • Lower bound
• 2017

  Edit distance neighbourhoods of input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 2017, Computer Science – Theory and Applications: International Computer Science Symposium in Russia. p. 260-272 (Lecture Notes in Computer Science; vol. 10304).

  Research output
  6 Citations (Scopus)