The following pages link to Alexander Okhotin (Q248926):
Displaying 50 items.
- (Q3416097) (← links)
- Language Equations with Symmetric Difference (Q3434703) (← links)
- On language equations with concatenation and various sets of Boolean operations (Q3465630) (← links)
- Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth (Q3499774) (← links)
- State complexity of cyclic shift (Q3515466) (← links)
- (Q3517096) (← links)
- On the Computational Completeness of Equations over Sets of Natural Numbers (Q3520304) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- On Language Equations XXK = XXL and XM = N over a Unary Alphabet (Q3584901) (← links)
- Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (Q3584905) (← links)
- Least and Greatest Solutions of Equations over Sets of Integers (Q3586104) (← links)
- Unambiguous Finite Automata over a Unary Alphabet (Q3586113) (← links)
- Communication of Two Stacks and Rewriting (Q3591427) (← links)
- Conjunctive Grammars with Restricted Disjunction (Q3599090) (← links)
- A Simple P-Complete Problem and Its Representations by Language Equations (Q3608489) (← links)
- Language Equations with Complementation (Q3617080) (← links)
- On Equations over Sets of Numbers and Their Limitations (Q3637239) (← links)
- (Q4412133) (← links)
- (Q4418613) (← links)
- (Q4418617) (← links)
- (Q4449179) (← links)
- (Q4452079) (← links)
- (Q4531380) (← links)
- (Q4599225) (← links)
- (Q4608614) (← links)
- (Q4665747) (← links)
- (Q4681310) (← links)
- On the Number of Nonterminal Symbols in Unambiguous Conjunctive Grammars (Q4686528) (← links)
- (Q4799361) (← links)
- On the complexity of the string generation problem (Q4809650) (← links)
- On the equivalence of linear conjunctive grammars and trellis automata (Q4825389) (← links)
- (Q4910734) (← links)
- On the State Complexity of Scattered Substrings and Superstrings (Q4932068) (← links)
- (Q4994937) (← links)
- On the Transformation of LL(k)-linear Grammars to LL(1)-linear (Q5042255) (← links)
- Computational and Proof Complexity of Partial String Avoidability (Q5061883) (← links)
- Extensions of unification modulo ACUI (Q5139274) (← links)
- (Q5145160) (← links)
- (Q5146525) (← links)
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- (Q5192986) (← links)
- Describing Periodicity in Two-Way Deterministic Finite Automata Using Transformation Semigroups (Q5199977) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- State Complexity of the Quotient Operation on Input-Driven Pushdown Automata (Q5205050) (← links)
- Unambiguous Conjunctive Grammars over a One-Letter Alphabet (Q5300847) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311142) (← links)
- (Q5313800) (← links)
- (Q5390009) (← links)
- Linear Grammars with One-Sided Contexts and Their Automaton Representation (Q5405039) (← links)
- Expressive Power of LL(k) Boolean Grammars (Q5444983) (← links)
