Travelled to:1 × Canada
1 × Germany
1 × Iceland
1 × Russia
1 × Taiwan
1 × The Netherlands
1 × USA
2 × France
2 × Japan
2 × Spain
3 × Hungary
3 × Italy
Collaborated with:∅ T.Lehtinen M.Barash K.Salomaa A.Jez M.Kunc G.Jirásková O.Yakimova J.Karhumäki
Talks about:grammar (11) boolean (8) languag (7) equat (6) context (5) conjunct (4) automata (4) two (4) determinist (3) unambigu (3)
Person: Alexander Okhotin
DBLP: Okhotin:Alexander
Facilitated 1 volumes:
EdContributed to:
2014
2014201320122013
201220112011201020092011200820102008
2008200720062006200520062003200320022002Wrote 27 papers:
- AFL-2014-BarashO
- Grammars with two-sided contexts (MB, AO), pp. 94–108.
- DLT-2014-OkhotinS #automaton #nondeterminism
- Input-Driven Pushdown Automata with Limited Nondeterminism — (AO, KS), pp. 84–102.
- DLT-2013-JezO #ambiguity #boolean grammar
- Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.
- DLT-2012-LehtinenO #context-free grammar #morphism
- Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 154–165.
- DLT-2012-Okhotin #theorem
- Non-erasing Variants of the Chomsky-Schützenberger Theorem (AO), pp. 121–129.
- DLT-J-2012-LehtinenO13 #context-free grammar #morphism
- Homomorphisms Preserving Deterministic Context-Free Languages (TL, AO), pp. 1049–1066.
- LATA-2012-BarashO #context-free grammar
- Defining Contexts in Context-Free Grammars (MB, AO), pp. 106–118.
- DLT-2011-KuncO #automaton #finite #using
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (MK, AO), pp. 324–336.
- LATA-2011-OkhotinS #ambiguity #automaton #complexity #word
- Descriptional Complexity of Unambiguous Nested Word Automata (AO, KS), pp. 414–426.
- DLT-2010-LehtinenO #equation #on the
- On Language Equations XXK = XXL and XM = N over a Unary Alphabet (TL, AO), pp. 291–302.
- DLT-2010-Okhotin #algorithm #boolean grammar #parsing #performance
- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
- DLT-2009-LehtinenO #equation #on the #set
- On Equations over Sets of Numbers and Their Limitations (TL, AO), pp. 360–371.
- DLT-J-2009-LehtinenO11 #equation #on the #set
- On Equations over Sets of Numbers and their Limitations (TL, AO), pp. 377–393.
- AFL-2008-LehtinenO #boolean grammar
- Boolean grammars and gsm mappings (TL, AO), pp. 269–280.
- AFL-J-2008-LehtinenO10 #boolean grammar
- Boolean Grammars and GSM Mappings (TL, AO), pp. 799–815.
- DLT-2008-JiraskovaO #automaton #complexity #finite #on the
- On the State Complexity of Operations on Two-Way Finite Automata (GJ, AO), pp. 443–454.
- ICALP-B-2008-JezO #equation #on the #set
- On the Computational Completeness of Equations over Sets of Natural Numbers (AJ, AO), pp. 63–74.
- LATA-2007-Okhotin #ambiguity #boolean grammar
- Unambiguous Boolean grammars (AO), pp. 473–484.
- DLT-2006-OkhotinY #equation
- Language Equations with Complementation (AO, OY), pp. 420–432.
- ICALP-v2-2006-KarhumakiKO #communication
- Communication of Two Stacks and Rewriting (JK, MK, AO), pp. 468–479.
- DLT-2005-Okhotin #boolean grammar #lr #parsing
- LR Parsing for Boolean Grammars (AO), pp. 362–373.
- DLT-J-2005-Okhotin06 #algorithm #boolean grammar #glr #parsing
- Generalized Lr Parsing Algorithm for Boolean Grammars (AO), pp. 629–664.
- DLT-2003-Okhotin #boolean grammar
- Boolean Grammars (AO), pp. 398–410.
- ICALP-2003-Okhotin #equation #problem
- Decision Problems for Language Equations with Boolean Operations (AO), pp. 239–251.
- CIAA-2002-Okhotin #linear #performance #recognition
- Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.
- CIAA-2002-Okhotin02a #boolean grammar #generative #parsing
- Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.
- DLT-2002-Okhotin #automaton #linear #representation
- Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.