The following pages link to Alexander Okhotin (Q248926):
Displayed 50 items.
- Equations over sets of integers with addition only (Q295632) (← links)
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
- On the expressive power of univariate equations over sets of natural numbers (Q418146) (← links)
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- State complexity of operations on two-way finite automata over a unary alphabet (Q443746) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- On the state complexity of operations on two-way finite automata (Q515574) (← links)
- On the number of nonterminals in linear conjunctive grammars (Q596108) (← links)
- A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
- Complexity of equations over sets of natural numbers (Q633764) (← links)
- One-nonterminal conjunctive grammars over a unary alphabet (Q639852) (← links)
- Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← links)
- Parsing Boolean grammars over a one-letter alphabet using online convolution (Q714852) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Language equations with complementation: expressive power (Q764318) (← links)
- State complexity of unambiguous operations on deterministic finite automata (Q778004) (← links)
- Cyclic shift on multi-component grammars (Q782585) (← links)
- Unresolved systems of language equations: expressive power and decision problems (Q817804) (← links)
- The hardest \(\operatorname{LL}(k)\) language (Q832952) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- Language equations with complementation: decision problems (Q880178) (← links)
- Unambiguous Boolean grammars (Q948095) (← links)
- Decision problems for language equations (Q972384) (← links)
- Conjunctive grammars with restricted disjunction (Q974750) (← links)
- The hardest linear conjunctive language (Q1007613) (← links)
- State complexity of power (Q1019718) (← links)
- A recognition and parsing algorithm for arbitrary conjunctive grammars. (Q1401337) (← links)
- Conjunctive grammars and systems of language equations (Q1403252) (← links)
- Top-down parsing of conjunctive languages (Q1604833) (← links)
- A tale of conjunctive grammars (Q1622943) (← links)
- Towards exact state complexity bounds for input-driven pushdown automata (Q1622993) (← links)
- Underlying principles and recurring ideas of formal grammars (Q1647674) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Representing recursively enumerable languages by iterated deletion (Q1826643) (← links)
- LR parsing for conjunctive grammars (Q1850932) (← links)
- On the closure properties of linear conjunctive languages. (Q1874415) (← links)
- Boolean grammars (Q1886037) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Longer shortest strings in two-way finite automata (Q2040414) (← links)
- State complexity of GF(2)-inverse and GF(2)-star on binary languages (Q2040418) (← links)
- Language equations (Q2074222) (← links)
- Deterministic one-way simulation of two-way deterministic finite automata over small alphabets (Q2096581) (← links)
- State complexity of union and intersection on graph-walking automata (Q2096590) (← links)
- On the determinization of event-clock input-driven pushdown automata (Q2097230) (← links)
- State complexity of GF(2)-operations on unary languages (Q2113387) (← links)
- Input-driven pushdown automata on well-nested infinite strings (Q2117102) (← links)
- Rational index of languages with bounded dimension of parse trees (Q2164007) (← links)