|
Search concepts
|
| Selected filters |
- 50 - 72 out of 72 results
- Export search results
Search results
-
2016
Input-driven languages are linear conjunctive
Okhotin, A., 2016, In : Theoretical Computer Science. 618, p. 52-71Research output
10 Citations (Scopus) -
2013
Reversibility of computations in graph-walking automata
Kunc, M. & Okhotin, A., 15 Oct 2013, Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Proceedings. p. 595-606 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8087 LNCS).Research output
10 Citations (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-63Research output
2 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-1019Research 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
-
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
9 Citations (Scopus) -
2018
Preface
Shallit, J. & Okhotin, A., 1 Apr 2018, In : Information and Computation. 259, p. 161-161 1 p.Research output
-
2014
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
3 Citations (Scopus) -
Transforming two-way alternating finite automata to one-way nondeterministic automata
Geffert, V. & Okhotin, A., 1 Jan 2014, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Proceedings. PART 1 ed. Springer Nature, p. 291-302 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8634 LNCS, no. PART 1).Research output
5 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 Access4 Citations (Scopus) -
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
5 Citations (Scopus) -
Representing Hyper-arithmetical Sets by Equations over Sets of Integers
Jez, A. & Okhotin, A., 1 Aug 2012, In : Theory of Computing Systems. 51, 2, p. 196-228 33 p.Research output
Open Access6 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
-
2015
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 Access12 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 Access7 Citations (Scopus) -
2015
Two-sided context specifications in formal grammars
Barash, M. & Okhotin, A., 2 Aug 2015, In : Theoretical Computer Science. 591, p. 134-153 20 p.Research output
7 Citations (Scopus) -
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 › › peer-review
-
2017
Unambiguous conjunctive grammars over a one-symbol alphabet
Jez, A. & Okhotin, A., 2017, In : Theoretical Computer Science. 665, p. 13-39Research output
3 Citations (Scopus) -
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-626Research output
-
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 › › peer-review
-
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
-
2013
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
5 Citations (Scopus)