Find Research outputs

Search results

• 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)

• 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)

• 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)

• A Tale of Conjunctive Grammars

  Okhotin, A., 1 Sep 2018, Developments in Language Theory - 22nd International Conference, DLT 2018, Proceedings. Hoshi, M. & Seki, S. (eds.). Springer Nature, p. 36-59 24 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11088 LNCS).

  Research output › › peer-review

  • Context free grammars
  • Narrative
  • Grammar
  • Syntactics
  • Context-free Grammar
  2 Citations (Scopus)

• Comparing linear conjunctive languages to subfamilies of the context-free languages

  Okhotin, A., 26 Jan 2011, SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science, Proceedings. p. 431-443 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6543 LNCS).

  Research output

  • Context free languages
  • Context-free Languages
  • Real-time
  • Cellular automata
  • Language
  11 Citations (Scopus)

• 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)

• Computational and proof complexity of partial string avoidability

  Itsykson, D., Okhotin, A. & Oparin, V., 1 Aug 2016, 41st International Symposium on Mathematical Foundations of Computer Science, MFCS 2016. Muscholl, A., Faliszewski, P. & Niedermeier, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 51. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 58).

  Research output

  • Computational complexity
  • Polynomials

• 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)

• 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)

• Conjunctive categorial grammars

  Kuznetsov, S. & Okhotin, A., 2017, Proceedings of the 15th Meeting on the Mathematics of Language.

  Research output

• 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

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

• 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

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

• Descriptional Complexity of Formal Systems

  Shallit, J. & Okhotin, A., 1 Jan 2015, Descriptional Complexity of Formal Systems - 17th International Workshop, DCFS 2015, Proceedings. Okhotin, A. & Shallit, J. (eds.). Springer Nature, (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9118).

  Research output

• Descriptional Complexity of Formal Systems

  Jürgensen, H., Karhumäki, J. & Okhotin, A., 11 Jan 2016, In : Theoretical Computer Science. 610, 1 p.

  Research output

• 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)

• Descriptional complexity of unambiguous input-driven pushdown automata

  Okhotin, A. & Salomaa, K., 1 Jan 2015, In : Theoretical Computer Science. 566, C, p. 1-11 11 p.

  Research output

  Open Access

  • Descriptional Complexity
  • Pushdown Automata
  • Automata
  • Complementation
  • Demonstrate
  12 Citations (Scopus)

• Descriptional complexity of unambiguous nested word automata

  Okhotin, A. & Salomaa, K., 8 Jun 2011, Language and Automata Theory and Applications - 5th International Conference, LATA 2011, Proceedings. p. 414-426 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6638 LNCS).

  Research output

  • Descriptional Complexity
  • Automata
  • State Complexity
  • Complementation
  • Pushdown Automata
  5 Citations (Scopus)

• 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)

• 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)

• 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

• 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)

• Formal Languages over GF(2)

  Bakinova, E., Basharin, A., Batmanov, I., Lyubort, K., Okhotin, A. & Sazhneva, E., 1 Jan 2018, Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Proceedings. Springer Nature, p. 68-79 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 10792 LNCS).

  Research output › › peer-review

  • Formal languages
  • Formal Languages
  • Concatenation
  • Computational complexity
  • Union
  8 Citations (Scopus)

• 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 › › peer-review

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

• 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

• 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)

• Generalized LR parsing for grammars with contexts

  Barash, M. & Okhotin, A., 1 Jan 2015, Computer Science - Theory and Applications - 10th International Computer Science Symposium in Russia, CSR 2015, Proceedings. Beklemishev, L. D., Musatov, D. V. & Musatov, D. V. (eds.). Springer Nature, p. 67-79 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9139).

  Research output

  • Parsing
  • Context free grammars
  • Grammar
  • Context-free Grammar
  • Context
  2 Citations (Scopus)

• Grammars with two-sided contexts

  Barash, M. & Okhotin, A., 21 May 2014, In : Electronic Proceedings in Theoretical Computer Science, EPTCS. 151, p. 94-108 15 p.

  Research output

  Open Access

  • Context free grammars
  • Specifications

• Graph-Walking Automata: From Whence They Come, and Whither They are Bound

  Okhotin, A., 1 Jul 2019, Implementation and Application of Automata - 24th International Conference, CIAA 2019, Proceedings. Hospodár, M. & Jirásková, G. (eds.). Springer Nature, p. 10-29 20 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11601 LNCS).

  Research output

  • Finite automata
  • Automata
  • Graph in graph theory
  • Finite Automata
  • Navigation

• 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

• Homomorphisms preserving deterministic context-free languages

  Lehtinen, T. & Okhotin, A., 1 Nov 2013, In : International Journal of Foundations of Computer Science. 24, 7, p. 1049-1066 18 p.

  Research output

  • Context free languages

• Improved normal form for grammars with one-sided contexts

  Okhotin, A., 11 Jul 2015, In : Theoretical Computer Science. 588, p. 52-72 21 p.

  Research output

  • Grammar
  • Normal Form
  • Context free grammars
  • Specifications
  • Context
  4 Citations (Scopus)

• Input-driven languages are linear conjunctive

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

  Research output
  10 Citations (Scopus)

• Input-driven pushdown automata with limited nondeterminism (Invited Paper)

  Okhotin, A. & Salomaa, K., 1 Jan 2014, Developments in Language Theory - 18th International Conference, DLT 2014, Proceedings. Springer Nature, p. 84-102 19 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8633 LNCS).

  Research output

  • Pushdown Automata
  • Nondeterminism
  • Path
  2 Citations (Scopus)

• 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)

• 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)

• 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

• 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

• Linear grammars with one-sided contexts and their automaton representation

  Barash, M. & Okhotin, A., 1 Apr 2015, In : RAIRO - Theoretical Informatics and Applications. 49, 2, p. 153-158 6 p.

  Research output

  • Cellular automata
  • Grammar
  • Automata
  • Turing machines
  • Context free grammars
  4 Citations (Scopus)

• Linear grammars with one-sided contexts and their automaton representation

  Barash, M. & Okhotin, A., 1 Jan 2014, LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Proceedings. Springer Nature, p. 190-201 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8392 LNCS).

  Research output

  • Cellular automata
  • Grammar
  • Automata
  • Turing machines
  • Context free grammars
  3 Citations (Scopus)

• 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)

• 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

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

• 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)

• On language equations with concatenation and various sets of boolean operations

  Okhotin, A., 1 Jul 2015, In : RAIRO - Theoretical Informatics and Applications. 49, 3, p. 205-232 28 p.

  Research output

  • Context free languages
  • Boolean Operation
  • Formal languages
  • Concatenation
  • Language

• On language equations with one-sided concatenation

  Baader, F. & Okhotin, A., 25 Nov 2013, In : Fundamenta Informaticae. 126, 1, p. 1-35 35 p.

  Research output

  • Formal languages
  • Concatenation
  • Language
  • Computer science
  • Formal Languages
  5 Citations (Scopus)

• 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

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

• 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 › › peer-review

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

• 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)

• 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

• 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

• 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)