| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexander Okhotin, Oksana Yakimova |
Language equations with complementation: Expressive power.  |
Theor. Comput. Sci.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Panos Rondogiannis |
On the expressive power of univariate equations over sets of natural numbers. |
Inf. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unambiguous finite automata over a unary alphabet. |
Inf. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Representing Hyper-arithmetical Sets by Equations over Sets of Integers. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail Barash, Alexander Okhotin |
Defining Contexts in Context-Free Grammars. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Franz Baader, Alexander Okhotin |
Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints. |
LPAR |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Expressive power of LL(k) Boolean grammars. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
A simple P-complete problem and its language-theoretic representations. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen, Alexander Okhotin |
On Equations over Sets of Numbers and their Limitations. |
Int. J. Found. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kunc, Alexander Okhotin |
State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
On the State Complexity of Star of Union and Star of Intersection. |
Fundam. Inform. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Complexity of Equations over Sets of Natural Numbers. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa |
Descriptional Complexity of Unambiguous Nested Word Automata. |
LATA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa |
State Complexity of Operations on Input-Driven Pushdown Automata. |
MFCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kunc, Alexander Okhotin |
Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups. |
Developments in Language Theory |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Kunc, Alexander Okhotin |
State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet. |
DCFS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin |
On stateless multihead automata: Hierarchies and the emptiness problem. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Christian Reitwießner |
Conjunctive grammars with restricted disjunction. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen, Alexander Okhotin |
Boolean Grammars and GSM Mappings. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Juhani Karhumäki, Michal Kunc, Alexander Okhotin |
Computational power of two stacks with restricted communication. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On the State Complexity of Scattered Substrings and Superstrings. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Univariate Equations Over Sets of Natural Numbers. |
Fundam. Inform. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
On equations over sets of integers |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Decision problems for language equations. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unambiguous Finite Automata over a Unary Alphabet. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Least and Greatest Solutions of Equations over Sets of Integers. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
On Equations over Sets of Integers. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen, Alexander Okhotin |
On Language Equations XXK = XXL and XM = N over a Unary Alphabet. |
Developments in Language Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin |
State complexity of power. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
Nondeterministic State Complexity of Positional Addition |
DCFS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
One-Nonterminal Conjunctive Grammars over a Unary Alphabet. |
CSR |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Equations over Sets of Natural Numbers with Addition Only. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen, Alexander Okhotin |
On Equations over Sets of Numbers and Their Limitations. |
Developments in Language Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Christian Reitwießner |
Conjunctive Grammars with Restricted Disjunction. |
SOFSEM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
State complexity of cyclic shift. |
ITA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unambiguous Boolean grammars. |
Inf. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Representing a P-complete problem by small trellis automata |
CSP |
2008 |
DBLP BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
On the Computational Completeness of Equations over Sets of Natural Numbers. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar H. Ibarra, Juhani Karhumäki, Alexander Okhotin |
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem. |
LATIN |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Artur Jez |
Complexity of solutions of equations over sets of natural numbers. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
On the State Complexity of Operations on Two-Way Finite Automata. |
Developments in Language Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Panos Rondogiannis |
On the expressive power of univariate equations over sets of natural numbers. |
IFIP TCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tommi Lehtinen, Alexander Okhotin |
Boolean grammars and gsm mappings. |
AFL |
2008 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin, Oksana Yakimova |
Language equations with complementation: Decision problems. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Notes on Dual Concatenation. |
Int. J. Found. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Recursive descent parsing for Boolean grammars. |
Acta Inf. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit |
Enumeration of Context-Free Languages and Related Structures. |
Journal of Automata, Languages and Combinatorics |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Nine Open Problems on Conjunctive and Boolean Grammars. |
Bulletin of the EATCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Artur Jez, Alexander Okhotin |
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unambiguous Boolean grammars. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
A Simple P-Complete Problem and Its Representations by Language Equations. |
MCU |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Expressive Power of LL(k) Boolean Grammars. |
FCT |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Juhani Karhumäki, Michal Kunc, Alexander Okhotin |
Computing by commuting. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Generalized Lr Parsing Algorithm for Boolean Grammars. |
Int. J. Found. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Computational Universality in One-variable Language Equations. |
Fundam. Inform. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Language Equations with Symmetric Difference. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Juhani Karhumäki, Michal Kunc, Alexander Okhotin |
Communication of Two Stacks and Rewriting. |
ICALP |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Oksana Yakimova |
Language Equations with Complementation. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
The dual of concatenation. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Unresolved systems of language equations: Expressive power and decision problems. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
A characterization of the arithmetical hierarchy by language equations. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa |
Contextual Grammars with Uniform Sets of Trajectories. |
Fundam. Inform. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Strict Language Inequalities and Their Decision Problems. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
LR Parsing for Boolean Grammars. |
Developments in Language Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Galina Jirásková, Alexander Okhotin |
State complexity of cyclic shift. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Jeffrey Shallit |
Enumeration of Context-Free Languages and Related Structures. |
DCFS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin |
Representing recursively enumerable languages by iterated deletion. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On the number of nonterminals in linear conjunctive grammars. |
Theor. Comput. Sci. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On the equivalence of linear conjunctive grammars and trellis automata. |
ITA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Boolean grammars. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
State Complexity of Linear Conjunctive Grammars. |
Journal of Automata, Languages and Combinatorics |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
The Dual of Concatenation. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On Computational Universality in Language Equations. |
MCU |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
A characterization of the arithmetical hierarchy by language equations. |
DCFS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Michael Domaratzki, Alexander Okhotin, Kai Salomaa, Sheng Yu (eds.) |
Implementation and Application of Automata, 9th International Conference, CIAA 2004, Kingston, Canada, July 22-24, 2004, Revised Selected Papers |
CIAA |
2004 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
The hardest linear conjunctive language. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
A recognition and parsing algorithm for arbitrary conjunctive grammars. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On the closure properties of linear conjunctive languages. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Efficient Automaton-Based Recognition For Linear Conjunctive Languages. |
Int. J. Found. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
An overview of conjunctive grammars, Formal Language Theory Column. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Decision Problems for Language Equations with Boolean Operations. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
language equations, recursive sets, Boolean operations |
| 1 | Alexander Okhotin |
Boolean Grammars. |
Developments in Language Theory |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
On the Number of Nonterminals in Linear Conjunctive Grammars. |
DCFS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Conjunctive Grammars and Systems of Language Equations. |
Programming and Computer Software |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
LR Parsing for Conjunctive Grammars. |
Grammars |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Top-Down Parsing of Conjunctive Languages. |
Grammars |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin, Kai Salomaa, Michael Domaratzki |
One-Visit Caterpillar Tree Automata. |
Fundam. Inform. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Automaton Representation of Linear Conjunctive Languages. |
Developments in Language Theory |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
State complexity of linear conjunctive languages. |
DCFS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Alexander Okhotin |
Whale Calf, a Parser Generator for Conjunctive Grammars. |
CIAA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Efficient Automaton-Based Recognition for Linear Conjunctive Languages. |
CIAA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Okhotin |
Conjunctive Grammars. |
Journal of Automata, Languages and Combinatorics |
2001 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")