 | 2009 |
|---|
| 56 |       | Artur Jez,
Alexander Okhotin:
One-Nonterminal Conjunctive Grammars over a Unary Alphabet.
CSR 2009: 191-202 |
| 55 | | Tommi Lehtinen,
Alexander Okhotin:
On Equations over Sets of Numbers and Their Limitations.
Developments in Language Theory 2009: 360-371 |
| 54 | | Alexander Okhotin,
Christian Reitwießner:
Conjunctive Grammars with Restricted Disjunction.
SOFSEM 2009: 425-436 |
| 53 | | Artur Jez,
Alexander Okhotin:
Equations over Sets of Natural Numbers with Addition Only.
STACS 2009: 577-588 |
| 52 | | Galina Jirásková,
Alexander Okhotin:
Nondeterministic State Complexity of Positional Addition
CoRR abs/0907.5072: (2009) |
| 51 | | Michael Domaratzki,
Alexander Okhotin:
State complexity of power.
Theor. Comput. Sci. 410(24-25): 2377-2392 (2009) |
| 2008 |
|---|
| 50 | | Alexander Okhotin:
Representing a P-complete problem by small trellis automata
CSP 2008: 185-198 |
| 49 | | Galina Jirásková,
Alexander Okhotin:
On the State Complexity of Operations on Two-Way Finite Automata.
Developments in Language Theory 2008: 443-454 |
| 48 | | Artur Jez,
Alexander Okhotin:
On the Computational Completeness of Equations over Sets of Natural Numbers.
ICALP (2) 2008: 63-74 |
| 47 | | Alexander Okhotin,
Panos Rondogiannis:
On the expressive power of univariate equations over sets of natural numbers.
IFIP TCS 2008: 215-227 |
| 46 | | Oscar H. Ibarra,
Juhani Karhumäki,
Alexander Okhotin:
On Stateless Multihead Automata: Hierarchies and the Emptiness Problem.
LATIN 2008: 94-105 |
| 45 | | Alexander Okhotin,
Artur Jez:
Complexity of solutions of equations over sets of natural numbers.
STACS 2008: 373-384 |
| 44 | | Galina Jirásková,
Alexander Okhotin:
State complexity of cyclic shift.
ITA 42(2): 335-360 (2008) |
| 43 | | Alexander Okhotin:
Unambiguous Boolean grammars.
Inf. Comput. 206(9-10): 1234-1247 (2008) |
| 2007 |
|---|
| 42 | | Artur Jez,
Alexander Okhotin:
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth.
CSR 2007: 168-181 |
| 41 | | Alexander Okhotin:
Expressive Power of LL(k) Boolean Grammars.
FCT 2007: 446-457 |
| 40 | | Alexander Okhotin:
A Simple P-Complete Problem and Its Representations by Language Equations.
MCU 2007: 267-278 |
| 39 | | Alexander Okhotin:
Recursive descent parsing for Boolean grammars.
Acta Inf. 44(3-4): 167-189 (2007) |
| 38 | | Alexander Okhotin:
Notes on Dual Concatenation.
Int. J. Found. Comput. Sci. 18(6): 1361-1370 (2007) |
| 37 |  | Michael Domaratzki,
Alexander Okhotin,
Jeffrey Shallit:
Enumeration of Context-Free Languages and Related Structures.
Journal of Automata, Languages and Combinatorics 12(1-2): 79-95 (2007) |
| 36 | | Alexander Okhotin,
Oksana Yakimova:
Language equations with complementation: Decision problems.
Theor. Comput. Sci. 376(1-2): 112-126 (2007) |
| 2006 |
|---|
| 35 | | Alexander Okhotin:
Language Equations with Symmetric Difference.
CSR 2006: 292-303 |
| 34 | | Alexander Okhotin,
Oksana Yakimova:
Language Equations with Complementation.
Developments in Language Theory 2006: 420-432 |
| 33 | | Juhani Karhumäki,
Michal Kunc,
Alexander Okhotin:
Communication of Two Stacks and Rewriting.
ICALP (2) 2006: 468-479 |
| 32 | | Alexander Okhotin:
Computational Universality in One-variable Language Equations.
Fundam. Inform. 74(4): 563-578 (2006) |
| 31 | | Alexander Okhotin:
Generalized Lr Parsing Algorithm for Boolean Grammars.
Int. J. Found. Comput. Sci. 17(3): 629-664 (2006) |
| 30 | | Juhani Karhumäki,
Michal Kunc,
Alexander Okhotin:
Computing by commuting.
Theor. Comput. Sci. 356(1-2): 200-211 (2006) |
| 2005 |
|---|
| 29 | | Alexander Okhotin:
LR Parsing for Boolean Grammars.
Developments in Language Theory 2005: 362-373 |
| 28 | | Alexander Okhotin:
Strict Language Inequalities and Their Decision Problems.
MFCS 2005: 708-719 |
| 27 | | Alexander Okhotin,
Kai Salomaa:
Contextual Grammars with Uniform Sets of Trajectories.
Fundam. Inform. 64(1-4): 341-351 (2005) |
| 26 | | Alexander Okhotin:
A characterization of the arithmetical hierarchy by language equations.
Int. J. Found. Comput. Sci. 16(5): 985-998 (2005) |
| 25 | | Alexander Okhotin:
The dual of concatenation.
Theor. Comput. Sci. 345(2-3): 425-447 (2005) |
| 24 | | Alexander Okhotin:
Unresolved systems of language equations: Expressive power and decision problems.
Theor. Comput. Sci. 349(3): 283-308 (2005) |
| 2004 |
|---|
| 23 | | 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
Springer 2004 |
| 22 | | Alexander Okhotin:
On Computational Universality in Language Equations.
MCU 2004: 292-303 |
| 21 | | Alexander Okhotin:
The Dual of Concatenation.
MFCS 2004: 698-710 |
| 20 | | Alexander Okhotin:
On the equivalence of linear conjunctive grammars and trellis automata.
ITA 38(1): 69-88 (2004) |
| 19 | | Alexander Okhotin:
Boolean grammars.
Inf. Comput. 194(1): 19-48 (2004) |
| 18 | | Alexander Okhotin:
State Complexity of Linear Conjunctive Grammars.
Journal of Automata, Languages and Combinatorics 9(2/3): 365-381 (2004) |
| 17 | | Michael Domaratzki,
Alexander Okhotin:
Representing recursively enumerable languages by iterated deletion.
Theor. Comput. Sci. 314(3): 451-457 (2004) |
| 16 | | Alexander Okhotin:
On the number of nonterminals in linear conjunctive grammars.
Theor. Comput. Sci. 320(2-3): 419-448 (2004) |
| 2003 |
|---|
| 15 | | Alexander Okhotin:
Boolean Grammars.
Developments in Language Theory 2003: 398-410 |
| 14 | | Alexander Okhotin:
Decision Problems for Language Equations with Boolean Operations.
ICALP 2003: 239-251 |
| 13 | | Alexander Okhotin:
An overview of conjunctive grammars, Formal Language Theory Column.
Bulletin of the EATCS 79: 145-163 (2003) |
| 12 | | Alexander Okhotin:
The hardest linear conjunctive language.
Inf. Process. Lett. 86(5): 247-253 (2003) |
| 11 | | Alexander Okhotin:
Efficient Automaton-Based Recognition For Linear Conjunctive Languages.
Int. J. Found. Comput. Sci. 14(6): 1103-1116 (2003) |
| 10 | | Alexander Okhotin:
On the closure properties of linear conjunctive languages.
Theor. Comput. Sci. 1-3(299): 663-685 (2003) |
| 9 | | Alexander Okhotin:
A recognition and parsing algorithm for arbitrary conjunctive grammars.
Theor. Comput. Sci. 302(1-3): 365-399 (2003) |
| 2002 |
|---|
| 8 | | Alexander Okhotin:
Efficient Automaton-Based Recognition for Linear Conjunctive Languages.
CIAA 2002: 169-181 |
| 7 | | Alexander Okhotin:
Whale Calf, a Parser Generator for Conjunctive Grammars.
CIAA 2002: 213-220 |
| 6 | | Alexander Okhotin:
Automaton Representation of Linear Conjunctive Languages.
Developments in Language Theory 2002: 393-404 |
| 5 | | Alexander Okhotin,
Kai Salomaa,
Michael Domaratzki:
One-Visit Caterpillar Tree Automata.
Fundam. Inform. 52(4): 361-375 (2002) |
| 4 | | Alexander Okhotin:
Top-Down Parsing of Conjunctive Languages.
Grammars 5(1): 21-40 (2002) |
| 3 | | Alexander Okhotin:
LR Parsing for Conjunctive Grammars.
Grammars 5(2): 81-124 (2002) |
| 2 | | Alexander Okhotin:
Conjunctive Grammars and Systems of Language Equations.
Programming and Computer Software 28(5): 243-249 (2002) |
| 2001 |
|---|
| 1 | | Alexander Okhotin:
Conjunctive Grammars.
Journal of Automata, Languages and Combinatorics 6(4): 519-535 (2001) |
