The following pages link to Alexander Okhotin (Q248926):
Displaying 50 items.
- Homomorphisms on graph-walking automata (Q2164747) (← links)
- Graph-walking automata: from whence they come, and whither they are bound (Q2177595) (← links)
- State complexity of GF(2)-concatenation and GF(2)-inverse on unary languages (Q2179341) (← links)
- On the expressive power of GF(2)-grammars (Q2206237) (← links)
- Reversibility of computations in graph-walking automata (Q2216129) (← links)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- On hardest languages for one-dimensional cellular automata (Q2232270) (← links)
- Computational completeness of equations over sets of natural numbers (Q2252522) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth (Q2268341) (← links)
- On the length of shortest strings accepted by two-way finite automata (Q2327545) (← links)
- State complexity of unambiguous operations on finite automata (Q2334604) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- State complexity of operations on input-driven pushdown automata (Q2396831) (← links)
- The quotient operation on input-driven pushdown automata (Q2401013) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Computing by commuting. (Q2490820) (← links)
- The dual of concatenation (Q2575759) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Recursive descent parsing for Boolean grammars (Q2641876) (← links)
- State complexity of transforming graph-walking automata to halting, returning and reversible (Q2687992) (← links)
- Nondeterministic state complexity of positional addition (Q2819384) (← links)
- Approximate Unification in the Description Logic $$\mathcal {FL}_0$$ (Q2835862) (← links)
- Improved Normal Form for Grammars with One-Sided Contexts (Q2843097) (← links)
- Reversibility of Computations in Graph-Walking Automata (Q2849946) (← links)
- Defining Contexts in Context-Free Grammars (Q2890184) (← links)
- Solving Language Equations and Disequations with Applications to Disunification in Description Logics and Monadic Set Constraints (Q2891443) (← links)
- Language equations with symmetric difference (Q2893311) (← links)
- On the state complexity of star of union and star of intersection (Q2895795) (← links)
- Input-Driven Pushdown Automata with Limited Nondeterminism (Q2921977) (← links)
- Transforming Two-Way Alternating Finite Automata to One-Way Nondeterministic Automata (Q2922024) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Descriptional Complexity of Unambiguous Nested Word Automata (Q3004601) (← links)
- (Q3005912) (← links)
- BOOLEAN GRAMMARS AND GSM MAPPINGS (Q3056280) (← links)
- Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534) (← links)
- ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS (Q3086245) (← links)
- State Complexity of Operations on Input-Driven Pushdown Automata (Q3088065) (← links)
- State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata (Q3100939) (← links)
- On equations over sets of integers (Q3113773) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Non-erasing Variants of the Chomsky–Schützenberger Theorem (Q3167489) (← links)
- Homomorphisms Preserving Deterministic Context-Free Languages (Q3167492) (← links)
- On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars (Q3167581) (← links)
- Generalized LR Parsing for Grammars with Contexts (Q3194708) (← links)
- One-Nonterminal Conjunctive Grammars over a Unary Alphabet (Q3392954) (← links)
- (Q3395960) (← links)
- (Q3396606) (← links)
- NOTES ON DUAL CONCATENATION (Q3401485) (← links)
